Sven Oliver Krumke

Tim Bergner

Theor. Comput. Sci., January, 2024

On the mixed connectivity conjecture of Beineke and Harary.

[BibT_eX]

[DOI]

Sebastian S. Johann

Ann. Oper. Res., January, 2024

QCEDA: Using Quantum Computers for EDA.

[BibT_eX]

[DOI]

CoRR, 2024

2022

Online algorithms to schedule a proportionate flexible flow shop of batching machines.

[BibT_eX]

[DOI]

J. Sched., 2022

2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem.

[BibT_eX]

[DOI]

Le Huy Minh

Oper. Res. Lett., 2022

Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions.

[BibT_eX]

[DOI]

BMC Medical Informatics Decis. Mak., 2022

Simultaneously dominating all spanning trees of a graph.

[BibT_eX]

[DOI]

Sebastian S. Johann

Electron. J. Graph Theory Appl., 2022

On Reward-Penalty-Selection Games.

[BibT_eX]

[DOI]

Niklas Gräf

CoRR, 2022

Towards Obtaining a 3-Decomposition From a Perfect Matching.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Local Certification of Reachability.

[BibT_eX]

[DOI]

Tim Bergner

Proceedings of the 10th International Network Optimization Conference, 2022

2021

Robust flows with adaptive mitigation.

[BibT_eX]

[DOI]

Heiner Ackermann

Erik Diessel

EURO J. Comput. Optim., 2021

Computing the egalitarian allocation with network flows.

[BibT_eX]

[DOI]

CoRR, 2021

The Reward-Penalty-Selection Problem.

[BibT_eX]

[DOI]

Karl-Heinz Küfer

CoRR, 2021

On the Connection between Individual Scaled Vickrey Payments and the Egalitarian Allocation.

[BibT_eX]

[DOI]

Niklas Gräf

CoRR, 2021

2020

Scheduling a proportionate flow shop of batching machines.

[BibT_eX]

[DOI]

J. Sched., 2020

Robust absolute single machine makespan scheduling-location problem on trees.

[BibT_eX]

[DOI]

Le Huy Minh

Oper. Res. Lett., 2020

Robust single machine makespan scheduling with release date uncertainty.

[BibT_eX]

[DOI]

Le Huy Minh

Oper. Res. Lett., 2020

On the Bicriterion Maximum Flow Network Interdiction Problem.

[BibT_eX]

[DOI]

CoRR, 2020

Efficient Generation of Application Specific Memory Controllers.

[BibT_eX]

[DOI]

Proceedings of the MEMSYS 2020: The International Symposium on Memory Systems, 2020

2019

Full implementation of social choice functions in dominant strategies.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2019

Robust multicovers with budgeted uncertainty.

[BibT_eX]

[DOI]

Eva Schmidt

Eur. J. Oper. Res., 2019

The Bicriterion Maximum Flow Network Interdiction Problem in <i>s</i>-<i>t</i>-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2019, 2019

Algorithms and Complexity for the Almost Equal Maximum Flow Problem.

[BibT_eX]

[DOI]

Rebekka Haese

Proceedings of the Operations Research Proceedings 2019, 2019

2018

An FPTAS for the knapsack problem with parametric weights.

[BibT_eX]

[DOI]

Nir Halman

Oper. Res. Lett., 2018

A generalized approximation framework for fractional network flow and packing problems.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2018

Simultaneous Dominating Set for Spanning Tree Factorings.

[BibT_eX]

[DOI]

Sebastian S. Johann

CoRR, 2018

Validating Measurement Data in Manufacturing Processes.

[BibT_eX]

[DOI]

David Brück

Proceedings of the Operations Research Proceedings 2018, 2018

2017

Maximum flows in generalized processing networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

On the complexity and approximability of budget-constrained minimum cost flows.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

An FPTAS for the parametric knapsack problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

A network simplex method for the budget-constrained minimum cost flow problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

An FPTAS for the Knapsack Problem with Parametric Weights.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Capacitated network design games with weighted players.

[BibT_eX]

[DOI]

André B. Chassein

Networks, 2016

Budget-constrained minimum cost flows.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation.

[BibT_eX]

[DOI]

Sabine Büttner

J. Comb. Optim., 2016

ConGen: An Application Specific DRAM Memory Controller Generator.

[BibT_eX]

[DOI]

Proceedings of the Second International Symposium on Memory Systems, 2016

2015

Robust bottleneck routing games.

[BibT_eX]

[DOI]

Thomas L. Werth

Sabine Büttner

Networks, 2015

On the Online Min-Wait Relocation Problem.

[BibT_eX]

[DOI]

Pascal Halffmann

Electron. Notes Discret. Math., 2015

Convex generalized flows.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem.

[BibT_eX]

[DOI]

Sahar Bsaybes

CoRR, 2015

2014

Computation of equilibria and the price of anarchy in bottleneck congestion games.

[BibT_eX]

[DOI]

Thomas L. Werth

Heike Sperber

Central Eur. J. Oper. Res., 2014

Relocation in Carsharing Systems Using Flows in Time-Expanded Networks.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Being Negative Makes Life NP-hard (for Product Sellers).

[BibT_eX]

[DOI]

Florian D. Schwahn

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Online delay management on a single train line: beyond competitive analysis.

[BibT_eX]

[DOI]

Marco Bender

Sabine Büttner

Public Transp., 2013

The generalized assignment problem with minimum quantities.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2013

Models and Algorithms for Carsharing Systems and Related Problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Generalized max flow in series-parallel graphs.

[BibT_eX]

[DOI]

Christiane Zeck

Discret. Optim., 2013

Online Job Admission.

[BibT_eX]

[DOI]

Rob van Stee

Proceedings of the Fundamental Problems in Computing, 2013

2012

Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537].

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Approximating Infeasible 2VPI-Systems.

[BibT_eX]

[DOI]

Neele Leithäuser

Maximilian Merkert

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

Truthful Mechanisms for Selfish Routing and Two-Parameter Agents.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization.

[BibT_eX]

[DOI]

Christiane Zeck

Math. Methods Oper. Res., 2011

Selfish bin coloring.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Minimum cost flows with minimum quantities.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Interval scheduling on related machines.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2011

Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines.

[BibT_eX]

[DOI]

Alfred Taudes

Comput. Oper. Res., 2011

MIP Formulations for Flowshop Scheduling with Limited Buffers.

[BibT_eX]

[DOI]

Janick V. Frasch

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

2010

clever or smart: Strategies for the online target date assignment problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

How hard is it to find extreme Nash equilibria in network congestion games?

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

New lower bounds for online k-server routing problems.

[BibT_eX]

[DOI]

Irene Fink

Inf. Process. Lett., 2009

Complexity of Strong Implementability

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fourth Athens Colloquium on Algorithms and Complexity, 2009

Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Graphentheoretische Konzepte und Algorithmen, 2. Auflage.

[BibT_eX]

Hartmut Noltemeier

Leitfäden der Informatik, Teubner, ISBN: 978-3-8348-0629-1, 2009

2008

Bincoloring.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

A monotone approximation algorithm for scheduling with precedence constraints.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Approximation algorithms for a vehicle routing problem.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2008

Semi-preemptive routing on trees.

[BibT_eX]

[DOI]

Dirk Räbiger

Rainer Schrader

Discret. Appl. Math., 2008

Pruning in column generation for service vehicle dispatching.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2008

A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

2007

Referee report on the book titled "Production planning by mixed integer programming".

[BibT_eX]

[DOI]

Elena O. Gavriliouk

Math. Methods Oper. Res., 2007

Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006

Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

How to whack moles.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

A heuristic for the Stacker Crane Problem on trees which is almost surely exact.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Till Nierhoff

J. Algorithms, 2006

Competitive Algorithms for Cottage Rental.

[BibT_eX]

[DOI]

Rob van Stee

Electron. Notes Discret. Math., 2006

Online-Optimization of Large-Scale Vehicle Dispatching Problems.

[BibT_eX]

[DOI]

Sleman Saliba

Electron. Notes Discret. Math., 2006

2005

A Hard Dial-a-Ride Problem that is Easy on Average.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Alberto Marchetti-Spaccamela

Till Nierhoff

J. Sched., 2005

On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.

[BibT_eX]

[DOI]

Leen Stougie

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

The Online Target Date Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Deterministic Online Optical Call Admission Revisited.

[BibT_eX]

[DOI]

Elisabeth Gassner

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

2004

Budget constrained minimum cost connected medians.

[BibT_eX]

[DOI]

Goran Konjevod

J. Discrete Algorithms, 2004

Reoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for ADAC.

[BibT_eX]

[DOI]

Benjamin Hiller

Electron. Notes Discret. Math., 2004

2003

News from the online traveling repairman.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

How to Whack Moles.

[BibT_eX]

[DOI]

Nicole Megow

Tjark Vredeveld

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Topology Control Problems under Symmetric and Asymmetric Power Thresholds.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002

Online Call Admission in Optical Networks with Larger Demands.

[BibT_eX]

[DOI]

Diana Poensgen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Budgeted Maximum Graph Coverage.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

How to cut a cake almost fairly.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Online-Dispatching of Automobile Service Units.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2002, 2002

Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows.

[BibT_eX]

[DOI]

Luis Miguel Torres

Proceedings of the Algorithms, 2002

Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Luigi Laura

Maarten Lipmann

Willem de Paepe

Diana Poensgen

Leen Stougie

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

Models and Approximation Algorithms for Channel Assignment in Radio Networks.

[BibT_eX]

[DOI]

S. S. Ravi

Wirel. Networks, 2001

The Online TSP Against Fair Adversaries.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2001

Upgrading bottleneck constrained forests.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Euler is standing in line dial-a-ride problems with precedence-constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Multiple Hotlink Assignment.

[BibT_eX]

[DOI]

Sven Fuhrmann

Hans-Christoph Wirth

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Online Bin Coloring.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

Online Dial-a-Ride Problems: Minimizing the Completion Time.

[BibT_eX]

[DOI]

Norbert Ascheuer

Proceedings of the STACS 2000, 2000

The Online Dial-a-Ride Problem under Reasonable Load.

[BibT_eX]

[DOI]

Dietrich Hauptmeier

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

Improving Spanning Trees by Upgrading Nodes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Improving Minimum Cost Spanning Trees by Upgrading Nodes.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Network Design and Improvement.

[BibT_eX]

[DOI]

Hartmut Noltemeier

Hans-Christoph Wirth

ACM Comput. Surv., 1999

Euler is Standing in Line.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998

Modifying Edges of a Network to Obtain Short Subgraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Approximation Algorithms for Certain Network Improvement Problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 1998

On Budget-Constrained Flow Improvement.

[BibT_eX]

[DOI]

S. Schwarz

Inf. Process. Lett., 1998

On the Minimum Label Spanning Tree Problem.

[BibT_eX]

[DOI]

Hans-Christoph Wirth

Inf. Process. Lett., 1998

1997

On the approximability of location and network design problems.

[BibT_eX]

[DOI]

PhD thesis, 1997

Compact Location Problems.

[BibT_eX]

[DOI]

Hartmut Noltemeier

Venkatesh Radhakrishnan

S. S. Ravi

Daniel J. Rosenkrantz

Theor. Comput. Sci., 1997

Network improvement problems.

[BibT_eX]

[DOI]

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996

Modifying Networks to Obtain Low Cost Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995

On a Generalization of the p-Center Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Complexity and Approximability of Certain Bicriteria Location Problems.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

Compact Location Problems with Budget and Communication Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1993

Compact Location Problems.

[BibT_eX]

[DOI]

Venkatesh Radhakrishnan