| Publication | Date of Publication | Type |
|---|
| A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem | 2024-07-05 | Paper |
| Worst-case analysis for on-line data compression | 2024-07-05 | Paper |
| Travelling salesman paths on Demidenko matrices | 2024-06-20 | Paper |
| Recognising permuted Demidenko matrices | 2024-06-17 | Paper |
| Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms | 2024-06-17 | Paper |
| One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs | 2024-06-05 | Paper |
| Epsilon-nets for halfplanes | 2024-02-28 | Paper |
| VC-dimensions for graphs (extended abstract) | 2024-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192487 | 2024-02-12 | Paper |
| A linear time algorithm for linearizing quadratic and higher-order shortest path problems | 2023-11-09 | Paper |
| Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations | 2023-07-03 | Paper |
| Sometimes travelling is easy: The master tour problem | 2023-05-08 | Paper |
| Non-preemptive tree packing | 2023-03-09 | Paper |
| The bipartite travelling salesman problem: A pyramidally solvable case | 2023-02-10 | Paper |
| A note on the complexity of the bilevel bottleneck assignment problem | 2022-11-17 | Paper |
| Continuous Facility Location on Graphs | 2022-10-14 | Paper |
| Minimum cost dynamic flows: The series-parallel case | 2022-08-30 | Paper |
| Polynomial graph-colorings | 2022-08-16 | Paper |
| Dispersing Obnoxious Facilities on a Graph | 2022-07-18 | Paper |
| Linearizable special cases of the quadratic shortest path problem | 2022-06-08 | Paper |
| Continuous facility location on graphs | 2022-03-22 | Paper |
| Non-preemptive tree packing | 2022-03-22 | Paper |
| Computation and complexity | 2022-02-16 | Paper |
| Fine-grained Complexity Analysis of Two Classic TSP Variants | 2022-02-08 | Paper |
| A linear time algorithm for the robust recoverable selection problem | 2021-09-15 | Paper |
| The trouble with the second quantifier | 2021-08-09 | Paper |
| The subset sum game revisited | 2021-08-05 | Paper |
| Graph Similarity and Approximate Isomorphism | 2021-08-04 | Paper |
| Dispersing obnoxious facilities on a graph | 2021-06-11 | Paper |
| The transportation problem with conflicts | 2021-05-05 | Paper |
| A faster algorithm for the continuous bilevel knapsack problem | 2021-04-07 | Paper |
| Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. | 2020-11-25 | Paper |
| The Open Shop Scheduling Problem | 2020-08-05 | Paper |
| The Dominating Set Problem in Geometric Intersection Graphs | 2020-05-27 | Paper |
| Timeline-based planning over dense temporal domains | 2020-04-21 | Paper |
| Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces | 2020-04-01 | Paper |
| Domination When the Stars Are Out | 2019-11-25 | Paper |
| Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points | 2019-09-09 | Paper |
| The complexity of dominating set in geometric intersection graphs | 2019-04-23 | Paper |
| Robust balanced optimization | 2019-03-19 | Paper |
| Some easy and some not so easy geometric optimization problems | 2019-01-15 | Paper |
| The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases | 2019-01-11 | Paper |
| The travelling salesman and the PQ-tree | 2019-01-11 | Paper |
| Group activity selection problem with approval preferences | 2018-11-09 | Paper |
| The triangle scheduling problem | 2018-11-07 | Paper |
| Getting the best response for your erg | 2018-11-05 | Paper |
| The subset sum game revisited | 2018-10-25 | Paper |
| Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces | 2018-10-04 | Paper |
| Vote trading and subset sums | 2018-09-28 | Paper |
| New special cases of the quadratic assignment problem with diagonally structured coefficient matrices | 2018-05-30 | Paper |
| Geometric versions of the three-dimensional assignment problem under general norms | 2018-05-24 | Paper |
| Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces | 2018-05-07 | Paper |
| The multi-stripe travelling salesman problem | 2018-02-15 | Paper |
| Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width | 2018-02-13 | Paper |
| Fine-grained complexity analysis of two classic TSP variants | 2017-12-19 | Paper |
| On-line and off-line approximation algorithms for vector covering problems | 2017-12-05 | Paper |
| The dynamics of power laws: fitness and aging in preferential attachment trees | 2017-11-09 | Paper |
| Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs | 2017-09-29 | Paper |
| Star Partitions of Perfect Graphs | 2017-07-05 | Paper |
| The one-dimensional Euclidean domain: finitely many obstructions are not enough | 2017-05-23 | Paper |
| Balanced Optimization with Vector Costs | 2017-04-04 | Paper |
| A PTAS for minimizing the weighted sum of job completion times on parallel machines | 2016-09-29 | Paper |
| Bilevel Knapsack with Interdiction Constraints | 2016-08-12 | Paper |
| There is no asymptotic PTAS for two-dimensional vector packing | 2016-06-09 | Paper |
| Shelf algorithms for on-line strip packing | 2016-05-26 | Paper |
| Linearizable special cases of the QAP | 2016-04-13 | Paper |
| Vertex cover meets scheduling | 2016-04-06 | Paper |
| The focus of attention problem | 2016-03-29 | Paper |
| Finding large degree-anonymous subgraphs is hard | 2016-02-26 | Paper |
| Are there any nicely structured preference profiles nearby? | 2016-02-09 | Paper |
| A New Tractable Case of the QAP with a Robinson Matrix | 2016-02-05 | Paper |
| Two birds and one stone | 2015-12-10 | Paper |
| Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms | 2015-11-20 | Paper |
| The geometric maximum traveling salesman problem | 2015-11-12 | Paper |
| The (weighted) metric dimension of graphs: hard and easy cases | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501827 | 2015-08-14 | Paper |
| Approximability and parameterized complexity of multicover by \(c\)-intervals | 2015-06-15 | Paper |
| Network-Based Vertex Dissolution | 2015-06-08 | Paper |
| Well-solvable cases of the QAP with block-structured matrices | 2015-05-22 | Paper |
| Four-point conditions for the TSP: the complete complexity classification | 2015-04-09 | Paper |
| Two hardness results for Gamson's game | 2015-01-09 | Paper |
| Core Stability in Hedonic Coalition Formation | 2014-11-04 | Paper |
| Network-Based Dissolution | 2014-10-14 | Paper |
| A Study on the Computational Complexity of the Bilevel Knapsack Problem | 2014-09-26 | Paper |
| Bilevel programming and the separation problem | 2014-08-29 | Paper |
| A Multivariate Complexity Analysis of Lobbying in Multiple Referenda | 2014-07-30 | Paper |
| The \(x\)-and-\(y\)-axes travelling salesman problem | 2014-07-27 | Paper |
| Star Partitions of Perfect Graphs | 2014-07-01 | Paper |
| A characterization of the single-crossing domain | 2014-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417626 | 2014-05-22 | Paper |
| Uniqueness in quadratic and hyperbolic \(0-1\) programming problems | 2014-05-15 | Paper |
| Realizing Small Tournaments Through Few Permutations | 2014-05-05 | Paper |
| Two hardness results for core stability in hedonic coalition formation games | 2014-04-22 | Paper |
| Nothing New about Equiangular Polygons | 2014-03-20 | Paper |
| Scheduling of pipelined operator graphs | 2014-02-05 | Paper |
| Analysis of multi-stage open shop processing systems | 2014-02-03 | Paper |
| The Complexity of Finding a Large Subgraph under Anonymity Constraints | 2014-01-14 | Paper |
| How to Put through Your Agenda in Collective Binary Decisions | 2013-12-17 | Paper |
| Complexity and in-approximability of a selection problem in robust optimization | 2013-12-02 | Paper |
| Motion planning with pulley, rope, and baskets | 2013-12-02 | Paper |
| The three-dimensional matching problem in kalmanson matrices | 2013-08-09 | Paper |
| A Complexity and Approximability Study of the Bilevel Knapsack Problem | 2013-03-19 | Paper |
| A hardness result for core stability in additive hedonic games | 2013-03-07 | Paper |
| Between a rock and a hard place: the two-to-one assignment problem | 2013-02-20 | Paper |
| Fully decomposable split graphs | 2013-01-24 | Paper |
| More on the majority rule: profiles, societies, and responsiveness | 2013-01-02 | Paper |
| A new characterization of the majority rule | 2013-01-01 | Paper |
| Caching is hard -- even in the fault model | 2012-12-06 | Paper |
| Complexity and approximation of an area packing problem | 2012-11-30 | Paper |
| Another well-solvable case of the QAP: maximizing the job completion time variance | 2012-11-08 | Paper |
| The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases | 2012-11-06 | Paper |
| An algorithmic study of switch graphs | 2012-10-15 | Paper |
| An algorithmic analysis of the Honey-Bee game | 2012-10-11 | Paper |
| Cinderella versus the Wicked Stepmother | 2012-09-21 | Paper |
| Motion planning with pulley, rope, and baskets | 2012-08-23 | Paper |
| Pinpointing the complexity of the interval min-max regret knapsack problem | 2012-06-20 | Paper |
| Exponential size neighborhoods for makespan minimization scheduling | 2012-06-18 | Paper |
| More about subcolorings | 2012-06-04 | Paper |
| The interval ordering problem | 2012-05-30 | Paper |
| Non-Approximability Results for Scheduling Problems with Minsum Criteria | 2012-05-30 | Paper |
| The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number | 2012-04-05 | Paper |
| The Wiener maximum quadratic assignment problem | 2012-03-07 | Paper |
| Charlemagne's Challenge: The Periodic Latency Problem | 2012-01-26 | Paper |
| Analysis of multi-stage open shop processing systems | 2012-01-23 | Paper |
| The Traveling Salesman Problem under squared Euclidean distances | 2012-01-23 | Paper |
| The Cinderella Game on Holes and Anti-holes | 2011-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3103294 | 2011-12-07 | Paper |
| How Cinderella Won the Bucket Game (and Lived Happily Ever After) | 2011-12-07 | Paper |
| String execution time for finite languages: max is easy, min is hard | 2011-10-27 | Paper |
| Paths, trees and matchings under disjunctive constraints | 2011-10-27 | Paper |
| Reachability and Deadlocking Problems in Multi-stage Scheduling | 2011-10-07 | Paper |
| Two-Bounded-Space Bin Packing Revisited | 2011-09-16 | Paper |
| The Northwest corner rule revisited | 2011-08-10 | Paper |
| A well-solvable special case of the bounded knapsack problem | 2011-08-09 | Paper |
| Domination When the Stars Are Out | 2011-07-06 | Paper |
| Unbounded knapsack problems with arithmetic weight sequences | 2011-06-22 | Paper |
| The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number | 2011-06-17 | Paper |
| Graph coloring with rejection | 2011-03-28 | Paper |
| Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh | 2011-03-22 | Paper |
| Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data | 2011-03-18 | Paper |
| Hamiltonian index is NP-complete | 2011-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3074469 | 2011-02-08 | Paper |
| How \(*\)not\(*\) to solve a sudoku | 2010-12-23 | Paper |
| Caching Is Hard – Even in the Fault Model | 2010-09-06 | Paper |
| Four point conditions and exponential neighborhoods for symmetric TSP | 2010-08-16 | Paper |
| Quadratic programming and combinatorial minimum weight product problems | 2010-07-21 | Paper |
| A comment on parallel-machine scheduling under a grade of service provision to minimize makespan | 2010-06-16 | Paper |
| The problem of the moody chess players | 2010-06-09 | Paper |
| The c game revisited | 2010-06-09 | Paper |
| Between a Rock and a Hard Place: The Two-to-One Assignment Problem | 2010-05-11 | Paper |
| Parallel machine scheduling with nested job assignment restrictions | 2010-03-18 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| The approximability of three-dimensional assignment problems with bottleneck objective | 2010-01-29 | Paper |
| An Algorithmic Study of Switch Graphs | 2010-01-21 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Fully Decomposable Split Graphs | 2009-12-11 | Paper |
| Threshold aggregation of multi-graded rankings | 2009-12-07 | Paper |
| Timetabling problems at the TU Eindhoven | 2009-12-07 | Paper |
| Partitioning graphs into connected parts | 2009-11-06 | Paper |
| How hard is it to find extreme Nash equilibria in network congestion games? | 2009-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396593 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396599 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396609 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396641 | 2009-09-19 | Paper |
| Partitioning Graphs into Connected Parts | 2009-08-18 | Paper |
| The complexity of economic equilibria for house allocation markets | 2009-07-09 | Paper |
| The computational complexity of graph contractions II: Two tough polynomially solvable cases | 2009-06-16 | Paper |
| Polygons with inscribed circles and prescribed side lengths | 2009-06-09 | Paper |
| The hardness of train rearrangements | 2009-05-07 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| The complexity of computing the Muirhead-Dalton distance | 2009-04-20 | Paper |
| Uncapacitated single and multiple allocation \(p\)-hub center problems | 2009-04-17 | Paper |
| How to detect a counterfeit coin: Adaptive versus non-adaptive solutions | 2009-03-23 | Paper |
| 2-piercings via graph theory | 2009-03-04 | Paper |
| Multigraph realizations of degree sequences: Maximization is easy, minimization is hard | 2008-11-27 | Paper |
| The Alcuin Number of a Graph | 2008-11-25 | Paper |
| An axiomatic characterization of the Hirsch-index | 2008-09-10 | Paper |
| Tight bounds for break minimization in tournament scheduling | 2008-09-04 | Paper |
| The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases | 2008-06-20 | Paper |
| Angle-restricted tours in the plane. | 2008-04-25 | Paper |
| Graph Coloring with Rejection | 2008-03-11 | Paper |
| Open problems around exact algorithms | 2008-02-26 | Paper |
| Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines | 2008-02-20 | Paper |
| Complexity of the job insertion problem in multi-stage scheduling | 2008-01-21 | Paper |
| A polynomial time equivalence between DNA sequencing and the exact perfect matching problem | 2008-01-18 | Paper |
| On the complexity of cake cutting | 2008-01-18 | Paper |
| Steiner diagrams and \(k\)-star hubs | 2008-01-11 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| An approximation scheme for cake division with a linear number of cuts | 2007-11-12 | Paper |
| Approximation schemes for a class of subset selection problems | 2007-09-18 | Paper |
| Roll cutting in the curtain industry, or: a well-solvable allocation problem | 2007-08-27 | Paper |
| Well-solvable instances for the partition problem | 2007-06-29 | Paper |
| Backbone colorings for graphs: Tree and path backbones | 2007-06-11 | Paper |
| Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines | 2007-05-29 | Paper |
| Timetabling problems at the TU Eindhoven | 2007-05-29 | Paper |
| Quadratic Programming and Combinatorial Minimum Weight Product Problems | 2007-05-02 | Paper |
| A NOTE ON FAIR DIVISION UNDER INTERVAL UNCERTAINTY | 2007-03-14 | Paper |
| Eliminating graphs by means of parallel knock-out schemes | 2007-02-19 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Sports tournaments, home-away assignments, and the break minimization problem | 2006-10-10 | Paper |
| Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult | 2006-08-16 | Paper |
| Disjoint Pairs with Distinct Sums | 2006-07-12 | Paper |
| Exact algorithms for the Hamiltonian cycle problem in planar graphs | 2006-06-30 | Paper |
| The constrained minimum weighted sum of job completion times problem | 2006-06-28 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Minimizing makespan and preemption costs on a system of uniform machines | 2006-03-21 | Paper |
| The no-wait flow-shop paradox | 2006-02-02 | Paper |
| Scheduling with step-improving processing times | 2006-01-18 | Paper |
| A comment on scheduling two parallel machines with capacity constraints | 2006-01-09 | Paper |
| Decomposition of integer matrices and multileaf collimator sequencing | 2005-12-27 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| On the dimension of simple monotonic games | 2005-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5702307 | 2005-11-01 | Paper |
| Banks winners in tournaments are difficult to recognize | 2005-10-19 | Paper |
| Discrete Geometry for Computer Imagery | 2005-09-13 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Combinatorial approximation algorithms: a comparative review | 2005-08-25 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS | 2005-06-22 | Paper |
| Approximation of the supply scheduling problem | 2005-06-01 | Paper |
| Faster algorithms for computing power indices in weighted voting games | 2005-06-01 | Paper |
| The two-dimensional cutting stock problem revisited | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668722 | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4659605 | 2005-03-21 | Paper |
| Radio Labeling with Preassigned Frequencies | 2005-02-23 | Paper |
| Project scheduling with irregular costs: complexity, approximability, and algorithms | 2005-02-09 | Paper |
| Inapproximability results for no-wait job shop scheduling. | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828941 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828942 | 2004-11-29 | Paper |
| Seventeen lines and one-hundred-and-one points | 2004-11-12 | Paper |
| It is tough to be a plumber | 2004-10-27 | Paper |
| All-norm approximation algorithms | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046488 | 2004-08-12 | Paper |
| All-Norm Approximation Algorithms | 2004-08-12 | Paper |
| Minimum-cost dynamic flows: The series-parallel case | 2004-08-04 | Paper |
| On the nearest neighbor rule for the traveling salesman problem | 2004-07-01 | Paper |
| The Post correspondence problem over a unary alphabet | 2004-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4459105 | 2004-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448764 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448768 | 2004-02-18 | Paper |
| A note on scoring rules that respect majority in choice and elimination. | 2004-02-03 | Paper |
| A note on the complexity of determining optimal strategies in games with common payoffs | 2003-12-16 | Paper |
| When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? | 2003-11-06 | Paper |
| Preemptive scheduling with rejection | 2003-10-29 | Paper |
| On the approximability of average completion time scheduling under precedence constraints. | 2003-09-25 | Paper |
| Which matrices are immune against the transportation paradox? | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427859 | 2003-09-14 | Paper |
| On tiling under tomographic constraints. | 2003-08-17 | Paper |
| Complexity and approximability results for slicing floorplan designs. | 2003-07-30 | Paper |
| Squares from Products of Consecutive Integers | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414481 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414486 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414647 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411360 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411417 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411420 | 2003-07-08 | Paper |
| Local search for the minimum label spanning tree problem with bounded color classes. | 2003-06-17 | Paper |
| The two-machine open shop problem: To fit or not to fit, that is the question | 2003-06-17 | Paper |
| Resource augmentation for online bounded space bin packing | 2003-05-14 | Paper |
| A branch-and-price algorithm for a hierarchical crew scheduling problem | 2003-05-08 | Paper |
| On-line scheduling of unit time jobs with rejection: Minimizing the total completion time | 2003-05-04 | Paper |
| Recognizing DNA graphs is difficult. | 2003-04-28 | Paper |
| The quadratic 0-1 knapsack problem with series-parallel support | 2003-04-02 | Paper |
| Embeddings of planar graphs that minimize the number of long-face cycles | 2003-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796169 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796173 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4793089 | 2003-02-18 | Paper |
| Off-line temporary tasks assignment. | 2003-01-21 | Paper |
| Some comments on sequencing with controllable processing times | 2003-01-20 | Paper |
| Linear time approximation scheme for the multiprocessor open shop problem | 2002-12-10 | Paper |
| The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152807 | 2002-10-23 | Paper |
| A comment on consecutive-2-out-of-\(n\) systems | 2002-09-22 | Paper |
| On-line scheduling on a single machine: Maximizing the number of early jobs | 2002-09-03 | Paper |
| An efficient algorithm for a class of constraint satisfaction problems | 2002-08-28 | Paper |
| The complexity of multiple wordlength assignment | 2002-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768378 | 2002-07-22 | Paper |
| Minimum-cost strong network orientation problems: Classification, complexity, and algorithms | 2002-07-21 | Paper |
| The reconstruction of polyominoes from their orthogonal projections | 2002-07-14 | Paper |
| A faster off-line algorithm for the TCP acknowledgement problem. | 2002-07-14 | Paper |
| Hardness of approximation of the discrete time-cost tradeoff problem | 2002-07-03 | Paper |
| A very difficult scheduling problem with communication delays | 2002-07-03 | Paper |
| The Stock Size Problem | 2002-07-01 | Paper |
| Caching for web searching | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535070 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331306 | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770587 | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754152 | 2001-12-09 | Paper |
| A polynomially solvable special case of the unbounded knapsack problem | 2001-12-05 | Paper |
| The Travelling Salesman and the PQ-Tree | 2001-11-26 | Paper |
| A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753942 | 2001-11-11 | Paper |
| A note on the depth function of combinatorial optimization problems | 2001-10-30 | Paper |
| Monge strikes again: Optimal placement of web proxies in the internet | 2001-10-21 | Paper |
| Approximation algorithms for the multiprocessor open shop scheduling problem | 2001-09-03 | Paper |
| A note on the complexity of the transportation problem with a permutable demand vector | 2001-09-03 | Paper |
| Randomized on-line scheduling on two uniform machines | 2001-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721975 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2714402 | 2001-06-13 | Paper |
| A comment on scheduling on uniform machines under chain-type precedence constraints | 2001-03-05 | Paper |
| Semi-online scheduling with decreasing job sizes | 2001-01-01 | Paper |
| The toughness of split graphs | 2000-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247460 | 2000-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252304 | 2000-09-26 | Paper |
| Polynomial time approximation algorithms for machine scheduling: Ten open problems | 2000-06-29 | Paper |
| A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952618 | 2000-05-10 | Paper |
| The maximum travelling salesman problem on symmetric Demidenko matrices | 2000-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944178 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936534 | 2000-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252365 | 2000-01-11 | Paper |
| A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. | 2000-01-01 | Paper |
| Optimal on-line algorithms for variable-sized bin covering | 1999-12-19 | Paper |
| On-line scheduling on a single machine: Minimizing the total completion time | 1999-11-09 | Paper |
| The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4269395 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234139 | 1999-10-28 | Paper |
| A comment on a minmax location problem | 1999-10-04 | Paper |
| The Steiner tree problem in Kalmanson matrices and in circulant matrices | 1999-09-22 | Paper |
| Sensitivity analysis for knapsack problems: Another negative result | 1999-09-22 | Paper |
| The travelling salesman problem on permuted Monge matrices | 1999-07-20 | Paper |
| A minimax assignment problem in treelike communication networks | 1999-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228496 | 1999-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4254354 | 1999-06-29 | Paper |
| The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases | 1999-06-28 | Paper |
| Makespan minimization in open shops: A polynomial time approximation scheme | 1999-06-03 | Paper |
| Sequencing jobs that require common resources on a single machine: A solvable case of the TSP | 1999-06-03 | Paper |
| Geometric three-dimensional assignment problems | 1999-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840359 | 1999-04-19 | Paper |
| A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252357 | 1999-01-01 | Paper |
| An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine | 1999-01-01 | Paper |
| One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs | 1998-12-06 | Paper |
| A solvable case of the quadratic assignment problem | 1998-12-03 | Paper |
| Time complexity and linear-time approximation of the ancient two-machine flow shop | 1998-11-01 | Paper |
| A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times | 1998-11-01 | Paper |
| Approximation schemes for scheduling on parallel machines | 1998-11-01 | Paper |
| On-line and off-line approximation algorithms for vector covering problems | 1998-10-01 | Paper |
| Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey | 1998-09-21 | Paper |
| Greedy Algorithms for On-Line Data Compression | 1998-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840371 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4394600 | 1998-06-11 | Paper |
| Three easy special cases of the euclidean travelling salesman problem | 1998-06-08 | Paper |
| Makespan minimization in preemptive two machine job shops | 1998-06-02 | Paper |
| Sometimes Travelling is Easy: The Master Tour Problem | 1998-05-11 | Paper |
| On-line scheduling of two-machine open shops where jobs arrive over time | 1998-04-13 | Paper |
| The disjoint cliques problem | 1998-02-19 | Paper |
| Hamiltonian cycles in circulant digraphs with two stripes | 1998-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373668 | 1998-01-21 | Paper |
| The VC-dimension of set systems defined by graphs | 1997-12-17 | Paper |
| The computational complexity of Steiner tree problems in graded matrices | 1997-12-09 | Paper |
| Unit-time scheduling problems with time dependent resources | 1997-09-07 | Paper |
| Simple but efficient approaches for the collapsing knapsack problem | 1997-09-04 | Paper |
| A polynomial-time approximation scheme for maximizing the minimum machine completion time | 1997-08-05 | Paper |
| Minimizing the total completion time in a unit-time open shop with release times | 1997-08-05 | Paper |
| Scheduling with time-dependent execution times | 1997-02-28 | Paper |
| Counting convex polygons in planar point sets | 1997-02-27 | Paper |
| The Convex-hull-and-k-line Travelling Salesman Problem | 1997-02-27 | Paper |
| An optimal algorithm for preemptive on-line scheduling | 1997-02-11 | Paper |
| On the recognition of permuted Supnick and incomplete Monge matrices | 1996-10-27 | Paper |
| Three-dimensional axial assignment problems with decomposable cost coefficients | 1996-10-03 | Paper |
| On-line \(q\)-adic covering by the method of the \(n\)-th segment and its application to on-line covering by cubes | 1996-09-18 | Paper |
| The fractional greedy algorithm for data compression | 1996-08-05 | Paper |
| On the recognition of permuted bottleneck Monge matrices | 1996-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883371 | 1996-07-01 | Paper |
| Scheduling with safety distances | 1996-05-30 | Paper |
| Permuting matrices to avoid forbidden submatrices | 1996-04-23 | Paper |
| The cone of Monge matrices: Extremal rays and applications | 1996-01-23 | Paper |
| On the rate of taxation in a cooperative bin packing game | 1996-01-07 | Paper |
| On the complexity of function learning | 1995-10-29 | Paper |
| A lower bound for randomized on-line scheduling algorithms | 1995-09-19 | Paper |
| On-line bin packing ? A restricted survey | 1995-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4836291 | 1995-07-25 | Paper |
| New lower and upper bounds for on-line scheduling | 1995-07-06 | Paper |
| Minimizing the weighted number of late jobs in UET open shops | 1995-06-25 | Paper |
| Monge matrices make maximization manageable | 1995-05-28 | Paper |
| Note: Open-shop scheduling with release dates to minimize maximum lateness | 1995-05-14 | Paper |
| Scheduling with incompatible jobs | 1995-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4291430 | 1995-01-22 | Paper |
| Vehicle scheduling in two-cycle flexible manufacturing systems | 1995-01-11 | Paper |
| UET-scheduling with chain-type precedence constraints | 1995-01-01 | Paper |
| Heuristics for parallel machine scheduling with delivery times | 1994-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4311199 | 1994-11-08 | Paper |
| Fast algorithms for the maximum convolution problem | 1994-10-10 | Paper |
| Drawing Graphs in the Plane with High Resolution | 1994-10-10 | Paper |
| Associativity of recurrence multiplication | 1994-09-22 | Paper |
| A general approach to avoiding two by two submatrices | 1994-09-01 | Paper |
| On-line scheduling of jobs with fixed start and end times | 1994-08-29 | Paper |
| Improved Space for Bounded-Space, On-Line Bin-Packing | 1994-08-14 | Paper |
| A new on-line scheduling heuristic | 1994-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281629 | 1994-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284253 | 1994-03-24 | Paper |
| The complexity of detecting crossingfree configurations in the plane | 1994-03-22 | Paper |
| On the Euclidean two paths problem | 1994-03-17 | Paper |
| Reconstructing sets of orthogonal line segments in the plane | 1994-02-07 | Paper |
| A tight bound for 3-partitioning | 1994-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4274209 | 1994-01-03 | Paper |
| A greedy heuristic for 3-partitioning with similar elements | 1993-10-18 | Paper |
| An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling | 1993-05-17 | Paper |
| Repacking helps in bounded space on-line bin-packing | 1993-05-04 | Paper |
| The complexity of finding arborescences in hypergraphs | 1993-04-01 | Paper |
| A heuristic for preemptive scheduling with set-up times | 1993-02-25 | Paper |
| Minimum-link paths among obstacles in the plane | 1993-01-17 | Paper |
| Detecting cycles through three fixed vertices in a graph | 1993-01-16 | Paper |
| On the equal-subset-sum problem | 1993-01-16 | Paper |
| Finding the closest extreme vertex to a fixed point | 1993-01-16 | Paper |
| The exact LPT-bound for maximizing the minimum completion time | 1992-12-17 | Paper |
| Counting convex \(k\)-gons in planar point sets | 1992-09-26 | Paper |
| Polynomial graph-colorings | 1992-06-28 | Paper |
| Almost tight bounds for \(\epsilon\)-nets | 1992-06-28 | Paper |
| UET-scheduling with constrained processor allocations | 1992-06-28 | Paper |
| Finding minimum area \(k\)-gons | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3989473 | 1992-06-28 | Paper |
| Counting \(k\)-subsets and convex \(k\)-gons in the plane | 1992-06-26 | Paper |
| On minimizing the sum of \(k\) tardinesses | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971282 | 1992-06-25 | Paper |
| Geometric clusterings | 1991-01-01 | Paper |
| A simple solution to the two paths problem in planar graphs | 1990-01-01 | Paper |
