Personal information

Emails & domains

Verified email addresses

Verified email domains

Websites & social links

Personal Website

Other IDs

GND: 1029723761
Scopus Author ID: 56928291200

Countries

Germany

Activities

Collapse all

Employment (2)

Universität Osnabrück: Osnabrück, Niedersachsen, DE

2018-01 to present | PostDoc (Institute for Computer Science)
Employment
Source: Self-asserted source
Fritz Bökler

TU Dortmund: Dortmund, DE

2012-05 to 2017-12 | PhD Student (Department of Computer Science)
Employment
Source: Self-asserted source
Fritz Bökler

Education and qualifications (2)

TU Dortmund: Dortmund, DE

2012-05 to 2018-04 | Dr. rer. nat. (Department of Computer Science)
Education
Source: Self-asserted source
Fritz Bökler

TU Dortmund: Dortmund, DE

2006-10 to 2012-04 | Dipl.-Inf. (Department of Computer Science)
Education
Source: Self-asserted source
Fritz Bökler

Works (9)

An Experimental Study of ILP Formulations for the Longest Induced Path Problem

Lecture Notes in Computer Science
2020 | Book chapter
DOI: 10.1007/978-3-030-53262-8_8
Part of ISBN: 9783030532611
Part of ISBN: 9783030532628
Part of ISSN: 0302-9743
Part of ISSN: 1611-3349
Source: Self-asserted source
Fritz Bökler

Approximating Multiobjective Shortest Path in Practice

2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX)
2020-01 | Book chapter
DOI: 10.1137/1.9781611976007.10
Part of ISBN: 9781611976007
Source: Self-asserted source
Fritz Bökler

Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem

2018 | Book
DNB: 1168009588
HANDLE: 2003/37134
URN: urn:nbn:de:101:1-2018092803420588322502
Contributors: Friedrich Konstantin Bökler; Petra Mutzel; Matthias Ehrgott
Source: Self-asserted source
Fritz Bökler via Deutsche Nationalbibliothek (DNB)

Multi-Objective Optimisation Based Planning of Power-Line Grid Expansions

ISPRS International Journal of Geo-Information
2018-06 | Journal article
DOI: 10.3390/ijgi7070258
Source: check_circle
Multidisciplinary Digital Publishing Institute

Output-sensitive complexity of multiobjective combinatorial optimization

Journal of Multi-Criteria Decision Analysis
2017 | Journal article
DOI: 10.1002/mcda.1603
EID:

2-s2.0-85015313234
Contributors: Bökler, F.; Ehrgott, M.; Morris, C.; Mutzel, P.
Source: Self-asserted source
Fritz Bökler via Scopus - Elsevier

The multiobjective shortest path problem is NP-hard, or is It?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2017 | Book
DOI: 10.1007/978-3-319-54157-0_6
EID:

2-s2.0-85014185199
Contributors: Bökler, F.
Source: Self-asserted source
Fritz Bökler via Scopus - Elsevier

Tree-deletion pruning in label-correcting algorithms for the multiobjective shortest path problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2017 | Book
DOI: 10.1007/978-3-319-53925-6_15
EID:

2-s2.0-85014181266
Contributors: Bökler, F.; Mutzel, P.
Source: Self-asserted source
Fritz Bökler via Scopus - Elsevier

Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2015 | Book
DOI: 10.1007/978-3-662-48350-3_25
EID:

2-s2.0-84945584151
Contributors: Bökler, F.; Mutzel, P.
Source: Self-asserted source
Fritz Bökler via Scopus - Elsevier

Algorithmen für das stochastische Steinerbaumproblem auf serien-parallelen Graphen

2012 | Book
DNB: 1025797507
Contributors: Fritz Bökler
Source: Self-asserted source
Fritz Bökler via Deutsche Nationalbibliothek (DNB)

Peer review (4 reviews for 4 publications/grants)

Review activity for Journal of global optimization. (1)
Review activity for Journal of optimization theory and applications. (1)
Review activity for Mathematical methods of operations research. (1)
Review activity for Top. (1)
How many people are using ORCID?