Gerhard J. Woeginger

Oper. Res. Lett., 2024

Travelling salesman paths on Demidenko matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

2023

Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms.

[BibT_eX]

[DOI]

Oper. Res. Lett., November, 2023

Recognising permuted Demidenko matrices.

[BibT_eX]

[DOI]

Oper. Res. Lett., September, 2023

Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations.

[BibT_eX]

[DOI]

Dirk Briskorn

Oper. Res. Lett., May, 2023

Non-Preemptive Tree Packing.

[BibT_eX]

[DOI]

Stefan Lendl

Lasse Wulf

Algorithmica, March, 2023

A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Continuous facility location on graphs.

[BibT_eX]

[DOI]

Tim A. Hartmann

Stefan Lendl

Math. Program., 2022

A note on the complexity of the bilevel bottleneck assignment problem.

[BibT_eX]

[DOI]

Dennis Fischer

Komal Muluk

4OR, 2022

2021

Fine-grained Complexity Analysis of Two Classic TSP Variants.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

The subset sum game revisited.

[BibT_eX]

[DOI]

Astrid Pieterse

Theory Comput. Syst., 2021

A linear time algorithm for the robust recoverable selection problem.

[BibT_eX]

[DOI]

Thomas Lachmann

Stefan Lendl

Discret. Appl. Math., 2021

The transportation problem with conflicts.

[BibT_eX]

[DOI]

Annette M. C. Ficker

Ann. Oper. Res., 2021

Dispersing Obnoxious Facilities on a Graph.

[BibT_eX]

[DOI]

Algorithmica, 2021

The trouble with the second quantifier.

[BibT_eX]

[DOI]

4OR, 2021

Linearizable Special Cases of the Quadratic Shortest Path Problem.

[BibT_eX]

[DOI]

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

An Investigation of the Recoverable Robust Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

Timeline-based planning over dense temporal domains.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A faster algorithm for the continuous bilevel knapsack problem.

[BibT_eX]

[DOI]

Dennis Fischer

Oper. Res. Lett., 2020

Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces.

[BibT_eX]

[DOI]

Algorithmica, 2020

2019

Computation and Complexity.

[BibT_eX]

[DOI]

Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

The complexity of Dominating Set in geometric intersection graphs.

[BibT_eX]

[DOI]

Mark de Berg

Sándor Kisfaludi-Bak

Theor. Comput. Sci., 2019

Domination When the Stars Are Out.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2019

Good Things Come to Those Who Swap Objects on Paths.

[BibT_eX]

[DOI]

CoRR, 2019

2018

The triangle scheduling problem.

[BibT_eX]

[DOI]

J. Sched., 2018

Preface to the Special Issue on Computer Science in Russia 2016.

[BibT_eX]

[DOI]

Alexander S. Kulikov

Theory Comput. Syst., 2018

Group activity selection problem with approval preferences.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2018

New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Robust balanced optimization.

[BibT_eX]

[DOI]

Annette M. C. Ficker

EURO J. Comput. Optim., 2018

Some Easy and Some Not so Easy Geometric Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

The Open Shop Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Graph Similarity and Approximate Isomorphism.

[BibT_eX]

[DOI]

Martin Grohe

Gaurav Rattan

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Committee Selection with Intraclass and Interclass Synergies.

[BibT_eX]

[DOI]

Rani Izsak

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

The one-dimensional Euclidean domain: finitely many obstructions are not enough.

[BibT_eX]

[DOI]

Jiehua Chen

Soc. Choice Welf., 2017

Partitioning Perfect Graphs into Stars.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems.

[BibT_eX]

[DOI]

Danny Hermelin

Judith-Madeleine Kubitza

Dvir Shabtay

CoRR, 2017

Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.

[BibT_eX]

[DOI]

CoRR, 2017

The multi-stripe travelling salesman problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2017

The Dominating Set Problem in Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Mark de Berg

Sándor Kisfaludi-Bak

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016

Finding large degree-anonymous subgraphs is hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Are there any nicely structured preference profiles nearby?

[BibT_eX]

[DOI]

Robert Bredereck

Jiehua Chen

Math. Soc. Sci., 2016

Linearizable special cases of the QAP.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Bilevel Knapsack with Interdiction Constraints.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2016

The triangle scheduling problem.

[BibT_eX]

[DOI]

CoRR, 2016

The Focus of Attention Problem.

[BibT_eX]

[DOI]

Algorithmica, 2016

Vertex Cover Meets Scheduling.

[BibT_eX]

[DOI]

Algorithmica, 2016

Balanced Optimization with Vector Costs.

[BibT_eX]

[DOI]

Annette M. C. Ficker

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width.

[BibT_eX]

[DOI]

René van Bevern

Robert Bredereck

Laurent Bulteau

Christian Komusiewicz

Proceedings of the Discrete Optimization and Operations Research, 2016

2015

How to Put Through Your Agenda in Collective Binary Decisions.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

Network-Based Vertex Dissolution.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Vote trading and subset sums.

[BibT_eX]

[DOI]

Sebastian Bervoets

Vincent Merlin

Oper. Res. Lett., 2015

Preface.

[BibT_eX]

[DOI]

Ali Ridha Mahjoub

Giovanni Rinaldi

Math. Program., 2015

Approximability and parameterized complexity of multicover by c-intervals.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Geometric versions of the three-dimensional assignment problem under general norms.

[BibT_eX]

[DOI]

Ante Custic

Discret. Optim., 2015

Well-solvable cases of the QAP with block-structured matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases.

[BibT_eX]

[DOI]

Algorithmica, 2015

Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs.

[BibT_eX]

[DOI]

Danny Hermelin

Judith-Madeleine Kubitza

Dvir Shabtay

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

A New Tractable Case of the QAP with a Robinson Matrix.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

A Study on the Computational Complexity of the Bilevel Knapsack Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2014

Two hardness results for Gamson's game.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2014

Bilevel programming and the separation problem.

[BibT_eX]

[DOI]

Andrea Lodi

Ted K. Ralphs

Math. Program., 2014

Investigations on the step-based research indices of Chambers and Miller.

[BibT_eX]

[DOI]

J. Informetrics, 2014

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2014

Four-point conditions for the TSP: The complete complexity classification.

[BibT_eX]

[DOI]

Discret. Optim., 2014

Geometric versions of the 3-dimensional assignment problem under general norms.

[BibT_eX]

[DOI]

Ante Custic

CoRR, 2014

Planar 3-dimensional assignment problems with Monge-like cost arrays.

[BibT_eX]

[DOI]

Ante Custic

CoRR, 2014

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.

[BibT_eX]

[DOI]

CoRR, 2014

Network-Based Dissolution.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Star Partitions of Perfect Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Another Look at the Shoelace TSP: The Case of Very Old Shoes.

[BibT_eX]

[DOI]

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

2013

Nothing New about Equiangular Polygons.

[BibT_eX]

[DOI]

Am. Math. Mon., 2013

A characterization of the single-crossing domain.

[BibT_eX]

[DOI]

Robert Bredereck

Jiehua Chen

Soc. Choice Welf., 2013

Uniqueness in quadratic and hyperbolic 0-1 programming problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

Motion Planning with Pulley, Rope, and Baskets.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

A hardness result for core stability in additive hedonic games.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2013

Analysis of multi-stage open shop processing systems.

[BibT_eX]

[DOI]

Alexander Schrijver

Math. Program., 2013

The three-dimensional matching problem in Kalmanson matrices.

[BibT_eX]

[DOI]

Sergey Polyakovskiy

J. Comb. Optim., 2013

Fully decomposable split graphs.

[BibT_eX]

[DOI]

Hajo Broersma

Dieter Kratsch

Eur. J. Comb., 2013

Two hardness results for core stability in hedonic coalition formation games.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Realizing Small Tournaments Through Few Permutations.

[BibT_eX]

[DOI]

Acta Cybern., 2013

Complexity and in-approximability of a selection problem in robust optimization.

[BibT_eX]

[DOI]

4OR, 2013

Core Stability in Hedonic Coalition Formation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

The Complexity of Finding a Large Subgraph under Anonymity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

A Complexity and Approximability Study of the Bilevel Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

An algorithmic analysis of the Honey-Bee game.

[BibT_eX]

[DOI]

Rudolf Fleischer

Theor. Comput. Sci., 2012

The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number.

[BibT_eX]

[DOI]

Péter Csorba

SIAM Rev., 2012

Scheduling of pipelined operator graphs.

[BibT_eX]

[DOI]

Hans L. Bodlaender

J. Sched., 2012

Another well-solvable case of the QAP: Maximizing the job completion time variance.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2012

Complexity and approximation of an area packing problem.

[BibT_eX]

[DOI]

Optim. Lett., 2012

Between a rock and a hard place: the two-to-one assignment problem.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2012

Guest Editorial to the special issue "Operations Research in Health Care" (EURO XXIII, July 5-8, 2009, Bonn).

[BibT_eX]

[DOI]

Erwin Pesch

Eur. J. Oper. Res., 2012

The x-and-y-axes travelling salesman problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

The interval ordering problem.

[BibT_eX]

[DOI]

Christoph Dürr

Maurice Queyranne

Fabrice Talla Nobibon

Discret. Appl. Math., 2012

Caching Is Hard - Even in the Fault Model.

[BibT_eX]

[DOI]

Algorithmica, 2012

An algorithmic study of switch graphs.

[BibT_eX]

[DOI]

Bastian Katz

Ignaz Rutter

Acta Informatica, 2012

Group Activity Selection Problem.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Transportation under Nasty Side Constraints.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Cinderella versus the Wicked Stepmother.

[BibT_eX]

[DOI]

Marijke H. L. Bodlaender

Vincent J. J. Kusters

Frank Staals

Hans Zantema

Proceedings of the Theoretical Computer Science, 2012

Divorcing Made Easy.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh.

[BibT_eX]

[DOI]

Murat Firat

Oper. Res. Lett., 2011

A well-solvable special case of the bounded knapsack problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

Graph coloring with rejection.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Charlemagne's Challenge: The Periodic Latency Problem.

[BibT_eX]

[DOI]

Sofie Coene

Oper. Res., 2011

Unbounded knapsack problems with arithmetic weight sequences.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2011

The Wiener maximum quadratic assignment problem.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Hamiltonian index is NP-complete.

[BibT_eX]

[DOI]

Zdenek Ryjácek

Liming Xiong

Discret. Appl. Math., 2011

The Northwest corner rule revisited.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Paths, trees and matchings under disjunctive constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

String execution time for finite languages: Max is easy, min is hard.

[BibT_eX]

[DOI]

Rong Su

Autom., 2011

The Cinderella Game on Holes and Anti-holes.

[BibT_eX]

[DOI]

Marijke H. L. Bodlaender

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

Reachability and Deadlocking Problems in Multi-stage Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 5th International Workshop, 2011

Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard.

[BibT_eX]

[DOI]

Nadja Betzler

Rolf Niedermeier

Proceedings of the IJCAI 2011, 2011

Two-Bounded-Space Bin Packing Revisited.

[BibT_eX]

[DOI]

Marek Chrobak

Proceedings of the Algorithms - ESA 2011, 2011

2010

Parallel machine scheduling with nested job assignment restrictions.

[BibT_eX]

[DOI]

Gabriella Muratore

Ulrich M. Schwarz

Oper. Res. Lett., 2010

How * not * to solve a Sudoku.

[BibT_eX]

[DOI]

Adriana Felicia Gabor

Oper. Res. Lett., 2010

The approximability of three-dimensional assignment problems with bottleneck objective.

[BibT_eX]

[DOI]

Optim. Lett., 2010

Pinpointing the complexity of the interval min-max regret knapsack problem.

[BibT_eX]

[DOI]

Discret. Optim., 2010

An Algorithmic Comparison of Three Scientific Impact Indices.

[BibT_eX]

[DOI]

Acta Cybern., 2010

The Traveling Salesman Problem under Squared Euclidean Distances.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

2009

Partitioning graphs into connected parts.

[BibT_eX]

[DOI]

Pim van 't Hof

Theor. Comput. Sci., 2009

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A new family of scientific impact measures: The generalized Kosmulski-indices.

[BibT_eX]

[DOI]

Scientometrics, 2009

The hardness of train rearrangements.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

Threshold aggregation of multi-graded rankings.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2009

The complexity of computing the Muirhead-Dalton distance.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2009

Generalizations of Egghe's g-index.

[BibT_eX]

[DOI]

J. Assoc. Inf. Sci. Technol., 2009

A comment on parallel-machine scheduling under a grade of service provision to minimize makespan.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Timetabling problems at the TU Eindhoven.

[BibT_eX]

[DOI]

John van den Broek

Eur. J. Oper. Res., 2009

Uncapacitated single and multiple allocation p-hub center problems.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

Polygons with inscribed circles and prescribed side lengths.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

Combinatorial Optimization Problems with Conflict Graphs.

[BibT_eX]

[DOI]

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

2008

Getting the best response for your erg.

[BibT_eX]

[DOI]

Patchrawat Uthaisombut

ACM Trans. Algorithms, 2008

Multigraph realizations of degree sequences: Maximization is easy, minimization is hard.

[BibT_eX]

[DOI]

Heather Hulett

Todd G. Will

Oper. Res. Lett., 2008

The computational complexity of graph contractions II: Two tough polynomially solvable cases.

[BibT_eX]

[DOI]

Networks, 2008

The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases.

[BibT_eX]

[DOI]

Networks, 2008

An axiomatic characterization of the Hirsch-index.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2008

An axiomatic analysis of Egghe's g-index.

[BibT_eX]

[DOI]

J. Informetrics, 2008

A symmetry axiom for scientific impact indices.

[BibT_eX]

[DOI]

J. Informetrics, 2008

Tight bounds for break minimization in tournament scheduling.

[BibT_eX]

[DOI]

Andries E. Brouwer

Gerhard F. Post

J. Comb. Theory A, 2008

The Magnus-Derek game revisited.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

The problem of the moody chess players.

[BibT_eX]

[DOI]

Fokko J. van de Bult

Inf. Process. Lett., 2008

Four Non-Deterministic Programming Exercises.

[BibT_eX]

Bull. EATCS, 2008

The Freudenthal Problem and its Ramifications (Part III).

[BibT_eX]

Bull. EATCS, 2008

Open problems around exact algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2-piercings via graph theory.

[BibT_eX]

[DOI]

Quintijn Puite

Discret. Appl. Math., 2008

The Alcuin Number of a Graph.

[BibT_eX]

[DOI]

Péter Csorba

Proceedings of the Algorithms, 2008

2007

Approximation schemes for a class of subset selection problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Preface.

[BibT_eX]

[DOI]

Jos C. M. Baeten

Jan Karel Lenstra

Theor. Comput. Sci., 2007

Complexity of the job insertion problem in multi-stage scheduling.

[BibT_eX]

[DOI]

Marc Wennink

Oper. Res. Lett., 2007

Quadratic programming and combinatorial minimum weight product problems.

[BibT_eX]

[DOI]

Walter Kern

Math. Program., 2007

Backbone colorings for graphs: Tree and path backbones.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Steiner diagrams and k-star hubs.

[BibT_eX]

[DOI]

Ulrich Blasum

Winfried Hochstättler

Peter Oertel

J. Discrete Algorithms, 2007

Roll cutting in the curtain industry, or: A well-solvable allocation problem.

[BibT_eX]

[DOI]

Arianna Alfieri

Steef L. van de Velde

Eur. J. Oper. Res., 2007

The Freudenthal Problem and its Ramifications (Part II).

[BibT_eX]

Bull. EATCS, 2007

On the complexity of cake cutting.

[BibT_eX]

[DOI]

Discret. Optim., 2007

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem.

[BibT_eX]

[DOI]

Discret. Optim., 2007

Eliminating graphs by means of parallel knock-out schemes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

An Approximation Scheme For Cake Division With A Linear Number Of Cuts.

[BibT_eX]

[DOI]

Comb., 2007

Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

2006

On the robust assignment problem under a fixed number of cost scenarios.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

Exact algorithms for the Hamiltonian cycle problem in planar graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

The traveling salesman problem with few inner points.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

Scheduling with step-improving processing times.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

The constrained minimum weighted sum of job completion times problem.

[BibT_eX]

[DOI]

Math. Program., 2006

A Note on Fair Division under Interval Uncertainty.

[BibT_eX]

[DOI]

Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2006

On the dimension of simple monotonic games.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins.

[BibT_eX]

Bull. EATCS, 2006

The Freudenthal Problem and its Ramifications (Part I).

[BibT_eX]

Bull. EATCS, 2006

Sports tournaments, home-away assignments, and the break minimization problem.

[BibT_eX]

[DOI]

Gerhard F. Post

Discret. Optim., 2006

Well-solvable instances for the partition problem.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2006

Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult.

[BibT_eX]

[DOI]

Algorithmica, 2006

Four point conditions and exponential neighborhoods for symmetric TSP.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Graph colorings.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Theor. Comput. Sci., 2005

Combinatorial approximation algorithms: a comparative review.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

The no-wait flow-shop paradox.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

Approximation of the supply scheduling problem.

[BibT_eX]

[DOI]

Satyaveer Singh Chauhan

Oper. Res. Lett., 2005

Faster algorithms for computing power indices in weighted voting games.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2005

The two-dimensional cutting stock problem revisited.

[BibT_eX]

[DOI]

Steven S. Seiden

Math. Program., 2005

Complexity and Approximability of Double Digest.

[BibT_eX]

[DOI]

Mark Cieliebak

Stephan J. Eidenbenz

J. Bioinform. Comput. Biol., 2005

A comment on scheduling two parallel machines with capacity constraints.

[BibT_eX]

[DOI]

Discret. Optim., 2005

Decomposition of integer matrices and multileaf collimator sequencing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Minimizing Makespan and Preemption Costs on a System of Uniform Machines.

[BibT_eX]

[DOI]

Hadas Shachnai

Tami Tamir

Algorithmica, 2005

Paths and cycles in colored graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

A Note on Semi-online Machine Covering.

[BibT_eX]

[DOI]

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

Roll Cutting in the Curtain Industry.

[BibT_eX]

[DOI]

Arianna Alfieri

Steef L. van de Velde

Proceedings of the Algorithms, 2005

Two Remarks on Reconstructing Binary Vectors from Their Absorbed Projections.

[BibT_eX]

[DOI]

Attila Kuba

Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Rodney G. Downey

Martin Grohe

Proceedings of the Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005, 2005

05301 Summary - Exact Algorithms and Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Rodney G. Downey

Martin Grohe

Proceedings of the Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005, 2005

2004

Seventeen lines and one-hundred-and-one points.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

It is tough to be a plumber.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Radio Labeling with Preassigned Frequencies.

[BibT_eX]

[DOI]

SIAM J. Optim., 2004

Inapproximability results for no-wait job shop scheduling.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

On the nearest neighbor rule for the traveling salesman problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

Minimum-cost dynamic flows: The series-parallel case.

[BibT_eX]

[DOI]

Networks, 2004

All-norm approximation algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 2004

Project scheduling with irregular costs: complexity, approximability, and algorithms.

[BibT_eX]

[DOI]

Alexander Grigoriev

Acta Informatica, 2004

Exact (Exponential) Algorithms for the Dominating Set Problem.

[BibT_eX]

[DOI]

Fedor V. Fomin

Dieter Kratsch

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

The Computational Complexity of the Minimum Weight Processor Assignment Problem.

[BibT_eX]

[DOI]

Hajo Broersma

Gerard J. M. Smit

Frank Vlaardingerbroek

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

Parallel Knock-Out Schemes in Networks.

[BibT_eX]

[DOI]

Hajo Broersma

Fedor V. Fomin

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Approximation Schemes for Broadcasting in Heterogenous Networks.

[BibT_eX]

[DOI]

Samir Khuller

Yoo Ah Kim

Proceedings of the Approximation, 2004

2003

On tiling under tomographic constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2003

Banks winners in tournaments are difficult to recognize.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2003

Local search for the minimum label spanning tree problem with bounded color classes.

[BibT_eX]

[DOI]

Tobias Brüggemann

Jérôme Monnot

Oper. Res. Lett., 2003

The two-machine open shop problem: To fit or not to fit, that is the question.

[BibT_eX]

[DOI]

Marjan van den Akker

Oper. Res. Lett., 2003

A note on scoring rules that respect majority in choice and elimination.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2003

Preemptive scheduling with rejection.

[BibT_eX]

[DOI]

Math. Program., 2003

A note on the complexity of determining optimal strategies in games with common payoffs.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2003

The geometric maximum traveling salesman problem.

[BibT_eX]

[DOI]

Alexander I. Barvinok

J. ACM, 2003

The complexity of economic equilibria for house allocation markets.

[BibT_eX]

[DOI]

Sándor P. Fekete

Inf. Process. Lett., 2003

How to detect a counterfeit coin: Adaptive versus non-adaptive solutions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Complexity and approximability results for slicing floorplan designs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2003

Preface: Volume 13.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

On the approximability of average completion time scheduling under precedence constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Recognizing DNA graphs is difficult.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Which matrices are immune against the transportation paradox?

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

The post correspondence problem over a unary alphabet.

[BibT_eX]

[DOI]

Piotr Rudnicki

Appl. Math. Lett., 2003

The Complexity of Graph Contractions.

[BibT_eX]

[DOI]

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

Backbone Colorings for Networks.

[BibT_eX]

[DOI]

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

A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves.

[BibT_eX]

[DOI]

Paul S. Bonsma

Tobias Brüggemann

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

A Lower Bound for Cake Cutting.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data.

[BibT_eX]

[DOI]

Mark Cieliebak

Stephan J. Eidenbenz

Alfred J. van der Poorten

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Off-line temporary tasks assignment.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Solution of a problem in DNA computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Squares from Products of Consecutive Integers.

[BibT_eX]

[DOI]

Am. Math. Mon., 2002

Embeddings of planar graphs that minimize the number of long-face cycles.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2002

An efficient algorithm for a class of constraint satisfaction problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2002

The quadratic 0-1 knapsack problem with series-parallel support.

[BibT_eX]

[DOI]

David J. Rader Jr.

Oper. Res. Lett., 2002

On-line scheduling of unit time jobs with rejection: minimizing the total completion time.

[BibT_eX]

[DOI]

John Noga

Oper. Res. Lett., 2002

The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs.

[BibT_eX]

[DOI]

Giovanni Rinaldi

Ulrich Voigt

Math. Program., 2002

Resource augmentation for online bounded space bin packing.

[BibT_eX]

[DOI]

J. Algorithms, 2002

A faster off-line algorithm for the TCP acknowledgement problem.

[BibT_eX]

[DOI]

John Noga

Steven S. Seiden

Inf. Process. Lett., 2002

Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints.

[BibT_eX]

[DOI]

Renaud Lepère

Denis Trystram

Int. J. Found. Comput. Sci., 2002

Open problems in the theory of scheduling.

[BibT_eX]

Bull. EATCS, 2002

Some Comments on Sequencing with Controllable Processing Times.

[BibT_eX]

[DOI]

Computing, 2002

More About Subcolorings.

[BibT_eX]

[DOI]

Computing, 2002

The complexity of multiple wordlength assignment.

[BibT_eX]

[DOI]

George A. Constantinides

Appl. Math. Lett., 2002

Caching for Web Searching.

[BibT_eX]

[DOI]

Algorithmica, 2002

A PTAS for single machine scheduling with controllable processing times.

[BibT_eX]

[DOI]

Acta Cybern., 2002

DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem.

[BibT_eX]

[DOI]

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

Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

The mathematics of playing golf.

[BibT_eX]

[DOI]

Giovanni Rinaldi

Ulrich Voigt

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

How to cut a cake almost fairly.

[BibT_eX]

[DOI]

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

An Approximation Scheme for Cake Division with a Linear Number of Cuts.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

Radio Labeling with Pre-assigned Frequencies.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

A polynomially solvable special case of the unbounded knapsack problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2001

A very difficult scheduling problem with communication delays.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2001

A comment on consecutive-2-out-of-<i>n</i> systems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2001

Hardness of approximation of the discrete time-cost tradeoff problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2001

The reconstruction of polyominoes from their orthogonal projections.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Non-Approximability Results for Scheduling Problems with Minsum Criteria.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2001

Resource augmentation for online bounded space bin packing

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

When does a dynamic programming formulation guarantee the existence of an FPTAS?

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

A note on the depth function of combinatorial optimization problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Linear time approximation scheme for the multiprocessor open shop problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

A Note on Tiling under Tomographic Constraints

[BibT_eX]

[DOI]

CoRR, 2001

The complexity of coloring graphs without long induced paths.

[BibT_eX]

[DOI]

Acta Cybern., 2001

De Bruijn Graphs and DNA Graphs.

[BibT_eX]

[DOI]

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

Complexity of Coloring Graphs without Forbidden Induced Subgraphs.

[BibT_eX]

[DOI]

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

Assigning chain-like tasks to a chain-like network.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Buying a Constant Competitive Ratio for Paging.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

Exact Algorithms for NP-Hard Problems: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 2001

2000

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

A comment on scheduling on uniform machines under chain-type precedence constraints.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2000

Monge strikes again: optimal placement of web proxies in the internet.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2000

Semi-online scheduling with decreasing job sizes.

[BibT_eX]

[DOI]

Steven S. Seiden

Oper. Res. Lett., 2000

On-line scheduling on a single machine: maximizing the number of early jobs.

[BibT_eX]

[DOI]

Chris N. Potts

Oper. Res. Lett., 2000

A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem.

[BibT_eX]

[DOI]

Math. Program., 2000

A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines.

[BibT_eX]

[DOI]

Math. Oper. Res., 2000

When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

[BibT_eX]

[DOI]

INFORMS J. Comput., 2000

The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

Introduction.

[BibT_eX]

[DOI]

Algorithmica, 2000

Pseudo-Hamiltonian Graphs.

[BibT_eX]

[DOI]

Luitpold Babel

Acta Cybern., 2000

Scheduling a pipelined operator graph.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Approximability and in-approximability results for no-wait shop scheduling.

[BibT_eX]

[DOI]

Maxim Sviridenko

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.

[BibT_eX]

[DOI]

Thomas Tautenhahn

SIAM J. Comput., 1999

Optimal on-line algorithms for variable-sized bin covering.

[BibT_eX]

[DOI]

Guochuan Zhang

Oper. Res. Lett., 1999

Approximation algorithms for the multiprocessor open shop scheduling problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1999

A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources.

[BibT_eX]

[DOI]

Dorit S. Hochbaum

Oper. Res. Lett., 1999

A note on the bottleneck graph partition problem.

[BibT_eX]

[DOI]

Networks, 1999

Minimum-cost strong network orientation problems: Classification, complexity, and algorithms.

[BibT_eX]

[DOI]

Networks, 1999

Erratum: The Travelling Salesman and the PQ-Tree.

[BibT_eX]

[DOI]

Math. Oper. Res., 1999

A note on the complexity of the transportation problem with a permutable demand vector.

[BibT_eX]

[DOI]

Mihály Hujter

Math. Methods Oper. Res., 1999

The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices.

[BibT_eX]

[DOI]

J. Comb. Optim., 1999

An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1999

Sensitivity Analysis for Knapsack Problems: Another Negative Result.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time.

[BibT_eX]

[DOI]

Amos Fiat

Acta Informatica, 1999

A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Preemptive Scheduling with Job-Dependent Setup Times.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Randomized Online Scheduling on Two Uniform Machines.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

An FPTAS for Agreeably Weighted Variance on a Single Machine.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

1998

Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey.

[BibT_eX]

[DOI]

René van Dal

Jack A. A. van der Veen

SIAM Rev., 1998

Sometimes Travelling is Easy: The Master Tour Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

A comment on a minmax location problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1998

One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1998

A solvable case of the quadratic assignment problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1998

Sequencing jobs that require common resources on a single machine: A solvable case of the TSP.

[BibT_eX]

[DOI]

Jack A. A. van der Veen

Shuzhong Zhang

Math. Program., 1998

Makespan minimization in open shops: A polynomial time approximation scheme.

[BibT_eX]

[DOI]

Math. Program., 1998

The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases.

[BibT_eX]

[DOI]

Math. Program., 1998

The Travelling Salesman and the PQ-Tree.

[BibT_eX]

[DOI]

Math. Oper. Res., 1998

On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time.

[BibT_eX]

[DOI]

J. Comb. Optim., 1998

The Travelling Salesman Problem on Permuted Monge Matrices.

[BibT_eX]

[DOI]

J. Comb. Optim., 1998

The Stock Size Problem.

[BibT_eX]

[DOI]

Oper. Res., 1998

The toughness of split graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

Makespan Minimization in Preemptive Two Machine Job Shops.

[BibT_eX]

[DOI]

Computing, 1998

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.

[BibT_eX]

[DOI]

Algorithmica, 1998

Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup Times.

[BibT_eX]

[DOI]

Acta Cybern., 1998

The Maximum Traveling Salesman Problem Under Polyhedral Norms.

[BibT_eX]

[DOI]

Alexander I. Barvinok

David S. Johnson

Russell Woodroofe

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

A polynomial-time approximation scheme for maximizing the minimum machine completion time.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1997

Minimizing the total completion time in a unit-time open shop with release times.

[BibT_eX]

[DOI]

Thomas Tautenhahn

Oper. Res. Lett., 1997

Greedy Algorithms for On-Line Data Compression.

[BibT_eX]

[DOI]

J. Algorithms, 1997

There is no Asymptotic PTAS for Two-Dimensional Vector Packing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Shelf Algorithms for On-Line Strip Packing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Hamiltonian cycles in circulant digraphs with two stripes.

[BibT_eX]

[DOI]

Discret. Math., 1997

Simple But Efficient Approaches for the Collapsing Knapsack Problem.

[BibT_eX]

[DOI]

David Pisinger

Discret. Appl. Math., 1997

The VC-dimension of Set Systems Defined by Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Unit-Time Scheduling Problems with Time Dependent Resources.

[BibT_eX]

[DOI]

Thomas Tautenhahn

Computing, 1997

Angle-Restricted Tours in the Plane.

[BibT_eX]

[DOI]

Sándor P. Fekete

Comput. Geom., 1997

Approximation Schemes for Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

The Convex-Hull-and-k-Line Travelling Salesman Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

The Fractional Greedy Algorithm for Data Compression.

[BibT_eX]

[DOI]

Computing, 1996

On the Recognition of Permuted Supnick and Incomplete Monge Matrices.

[BibT_eX]

[DOI]

Acta Informatica, 1996

On-line and Off-line Approximation Algorithms for Vector Covering Problems.

[BibT_eX]

[DOI]

Noga Alon

Proceedings of the Algorithms, 1996

Competitive Odds and Ends.

[BibT_eX]

[DOI]

Amos Fiat

Proceedings of the Online Algorithms, 1996

Competitive Analysis of Algorithms.

[BibT_eX]

[DOI]

Amos Fiat

Proceedings of the Online Algorithms, 1996

On-line Packing and Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the Online Algorithms, 1996

1995

An optimal algorithm for preemptive on-line scheduling.

[BibT_eX]

[DOI]

André van Vliet

Oper. Res. Lett., 1995

On the rate of taxation in a cooperative bin packing game.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1995

The cone of Monge matrices: Extremal rays and applications.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1995

Minimizing the weighted number of late jobs in UET open shops.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1995

On-line bin packing - A restricted survey.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1995

On the Complexity of Function Learning.

[BibT_eX]

[DOI]

Mach. Learn., 1995

Scheduling with Time-Dependent Execution Times.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Counting Convex Polygons in Planar Point Sets.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Gopalakrishnan Sundaram

Inf. Process. Lett., 1995

on the Recognition of Permuted Bottleneck Monge Matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

Permuting Matrices to Avoid Forbidden Submatrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

UET-scheduling with chain-type precedence constraints.

[BibT_eX]

[DOI]

Comput. Oper. Res., 1995

Scheduling with safety distances.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1995

VC-Dimensions for Graphs (Extended Abstract).

[BibT_eX]

[DOI]

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

A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics and Computer Science, 1995

Worst-Case Analysis for On-Line Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics and Computer Science, 1995

1994

On-Line Scheduling of Jobs with Fixed Start and End Times.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Monge matrices make maximization manageable.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1994

New lower and upper bounds for on-line scheduling.

[BibT_eX]

[DOI]

André van Vliet

Oper. Res. Lett., 1994

Fast algorithms for the maximum convolution problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1994

Some Geometric Clustering Problems.

[BibT_eX]

Nord. J. Comput., 1994

A Lower Bound for Randomized On-Line Scheduling Algorithms.

[BibT_eX]

[DOI]

André van Vliet

Inf. Process. Lett., 1994

Scheduling with Incompatible Jobs.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Discret. Appl. Math., 1994

A general approach to avoiding two by two submatrices.

[BibT_eX]

[DOI]

Computing, 1994

Partitioning Graphs into Two Trees.

[BibT_eX]

[DOI]

En-Yu Yao

Acta Cybern., 1994

Heuristics for Parallel Machine Scheduling with Delivery Times.

[BibT_eX]

[DOI]

Acta Informatica, 1994

1993

Improved Space for Bounded-Space, On-Line Bin-Packing.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1993

An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Drawing Graphs in the Plane with High Resolution.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Antonios Symvonis

Emo Welzl

SIAM J. Comput., 1993

Reconstructing sets of orthogonal line segments in the plane.

[BibT_eX]

[DOI]

Franz Rendl

Discret. Math., 1993

A Tight Bound for 3-Partitioning.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

On the Euclidean two Paths Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

A Greedy-heuristic for 3-partitioning with similar elements.

[BibT_eX]

[DOI]

Computing, 1993

Repacking helps in bounded space on-line bind-packing.

[BibT_eX]

[DOI]

Gerhard Johannes Woeginger

Computing, 1993

The Complexity of Detecting Crossingfree Configurations in the Plane.

[BibT_eX]

[DOI]

BIT, 1993

A Lower Bound for On-Line Vector-Packing Algorithms.

[BibT_eX]

[DOI]

Acta Cybern., 1993

Computing the optimum stock size.

[BibT_eX]

Franz Rendl

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

Maximum Covering with D Cliques.

[BibT_eX]

[DOI]

Petra Scheffler

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992

The Disjoint Cliques Problem

[BibT_eX]

Petra Scheffler

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

The exact LPT-bound for maximizing the minimum completion time.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1992

On the Equal-Subset-Sum Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

The Complexity of Finding Arborescences in Hypergraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Finding the Closest Extreme Vertex to a Fixed Point.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Counting Convex k-Gons in Planar Point Sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Detecting Cycles Through Three Fixed Vertices in a Graph.

[BibT_eX]

[DOI]

Herbert Fleischner

Inf. Process. Lett., 1992

Almost Tight Bounds for epsilon-Nets.

[BibT_eX]

[DOI]

János Komlós

János Pach

Discret. Comput. Geom., 1992

Finding Minimum Area k-gons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1992

Polynomial graph-colorings.

[BibT_eX]

[DOI]

Wolfgang Gutjahr

Emo Welzl

Discret. Appl. Math., 1992

UET-scheduling with constrained processor allocations.

[BibT_eX]

[DOI]

Gerhard Johannes Woeginger

Comput. Oper. Res., 1992

A heuristic for preemptive scheduling with set-up times.

[BibT_eX]

[DOI]

Computing, 1992

Minimum-Link Paths Among Obstacles in the Plan.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Algorithmica, 1992

Computing Maximum Valued Regions.

[BibT_eX]

[DOI]

Acta Cybern., 1992

1991

Geometric Clusterings.

[BibT_eX]

[DOI]

Vasilis Capoyleas

J. Algorithms, 1991

On Minimizing the Sum of k Tardinesses.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Counting k-Subsets and Convex k-gons in the Plane.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

1990

A Simple Solution to the Two Paths Problem in Planar Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

On the reconstruction of simple polygons.

[BibT_eX]

Michael Formann

Bull. EATCS, 1990

Some New Bounds for Epsilon-Nets.

[BibT_eX]

[DOI]

János Pach

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Minimum-Link Paths Among Obstacles in the Plane.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1988

Epsilon-Nets for Halfplanes.

[BibT_eX]

[DOI]