| Publication | Date of Publication | Type |
|---|
| Improving upper and lower bounds for the total number of edge crossings of Euclidean minimum weight Laman graphs | 2023-03-30 | Paper |
| Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks | 2023-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091004 | 2022-07-21 | Paper |
| Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights | 2021-10-04 | Paper |
| Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks | 2021-06-22 | Paper |
| Minsum \(k\)-sink problem on path networks | 2020-01-16 | Paper |
| Minmax-regret evacuation planning for cycle networks | 2019-10-15 | Paper |
| The mixed evacuation problem | 2018-12-06 | Paper |
| Minsum \(k\)-sink problem on dynamic flow path networks | 2018-09-06 | Paper |
| Minimax regret 1-median problem in dynamic path networks | 2018-08-03 | Paper |
| A population-based algorithm for solving linear assignment problems with two objectives | 2018-07-11 | Paper |
| A proof of the molecular conjecture | 2017-10-20 | Paper |
| Notes on computing peaks in k-levels and parametric spanning trees | 2017-09-29 | Paper |
| Improved algorithms for computing \(k\)-sink on dynamic flow path networks | 2017-09-22 | Paper |
| Geometric p-Center Problems with Centers Constrained to Two Lines | 2017-02-01 | Paper |
| Continuous Folding of Regular Dodecahedra | 2017-02-01 | Paper |
| The Mixed Evacuation Problem | 2017-02-01 | Paper |
| Minimax regret 1-median problem in dynamic path networks | 2016-09-29 | Paper |
| Extended formulations for sparsity matroids | 2016-08-25 | Paper |
| An inductive construction of minimally rigid body-hinge simple graphs | 2016-06-27 | Paper |
| A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems | 2016-06-09 | Paper |
| On the edge crossing properties of Euclidean minimum weight Laman graphs | 2016-01-18 | Paper |
| Optimally bracing grid frameworks with holes | 2015-12-11 | Paper |
| Multiple sink location problems in dynamic path networks | 2015-12-08 | Paper |
| Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs | 2015-12-01 | Paper |
| Straight-Line Drawability of a Planar Graph Plus an Edge | 2015-10-30 | Paper |
| Optimally Bracing Grid Frameworks with Holes | 2015-09-11 | Paper |
| A linear-time algorithm for testing outer-1-planarity | 2015-09-02 | Paper |
| Minimax regret 1-sink location problem in dynamic path networks | 2015-06-11 | Paper |
| Multiple Sink Location Problems in Dynamic Path Networks | 2015-05-20 | Paper |
| Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity | 2015-01-15 | Paper |
| The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths | 2014-09-12 | Paper |
| Online graph exploration algorithms for cycles and trees by multiple searchers | 2014-07-11 | Paper |
| Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity | 2014-02-18 | Paper |
| On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs | 2014-01-14 | Paper |
| A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system | 2014-01-13 | Paper |
| A Linear-Time Algorithm for Testing Outer-1-Planarity | 2013-12-20 | Paper |
| An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs | 2013-12-10 | Paper |
| Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries | 2013-06-27 | Paper |
| Minimax Regret 1-Sink Location Problems in Dynamic Path Networks | 2013-05-28 | Paper |
| Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time | 2013-04-03 | Paper |
| Independent arborescences in directed graphs | 2013-03-01 | Paper |
| A rooted-forest partition with uniform vertex demand | 2012-12-21 | Paper |
| Topology optimization of trusses with stress and local constraints on nodal stability and member intersection | 2012-07-31 | Paper |
| Online Exploration of All Vertices in a Simple Polygon | 2012-07-16 | Paper |
| A proof of the molecular conjecture | 2011-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084809 | 2011-03-25 | Paper |
| The Structure and Number of Global Roundings of a Graph | 2011-03-18 | Paper |
| Covering directed graphs by in-trees | 2011-02-18 | Paper |
| SEQUENTIAL SEMIDEFINITE PROGRAMMING FOR OPTIMIZATION OF FRAMED STRUCTURES UNDER MULTIMODAL BUCKLING CONSTRAINTS | 2011-02-10 | Paper |
| Arc-disjoint in-trees in directed graphs | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579487 | 2010-08-06 | Paper |
| Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees | 2010-04-28 | Paper |
| An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths | 2010-04-28 | Paper |
| A GEOMETRIC SPANNER OF SEGMENTS | 2010-03-19 | Paper |
| Parametric search: three new applications | 2010-02-26 | Paper |
| A Rooted-Forest Partition with Uniform Vertex Demand | 2010-02-09 | Paper |
| On the Infinitesimal Rigidity of Bar-and-Slider Frameworks | 2009-12-17 | Paper |
| A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths | 2009-12-17 | Paper |
| Fast enumeration algorithms for non-crossing geometric graphs | 2009-08-27 | Paper |
| The Minimum Weight In-Tree Cover Problem | 2009-05-13 | Paper |
| Enumerating Constrained Non-crossing Geometric Spanning Trees | 2009-03-06 | Paper |
| Fast enumeration algorithms for non-crossing geometric graphs | 2009-02-12 | Paper |
| Voronoi diagrams with respect to criteria on vision information | 2008-09-25 | Paper |
| Enumerating constrained non-crossing minimally rigid frameworks | 2008-09-24 | Paper |
| Geometric Spanner of Objects under L 1 Distance | 2008-07-10 | Paper |
| Covering Directed Graphs by In-Trees | 2008-07-10 | Paper |
| Geometric Spanner of Segments | 2008-05-27 | Paper |
| Triangulating a convex polygon with fewer number of non-standard bars | 2008-01-07 | Paper |
| Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths | 2008-01-04 | Paper |
| An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity | 2008-01-04 | Paper |
| An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths | 2008-01-04 | Paper |
| Enumerating Non-crossing Minimally Rigid Frameworks | 2007-09-10 | Paper |
| Enumerating non-crossing minimally rigid frameworks | 2007-07-19 | Paper |
| An approximation algorithm for the pickup and delivery vehicle routing problem on trees | 2007-01-09 | Paper |
| POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA | 2006-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3366135 | 2006-02-13 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION | 2005-06-10 | Paper |
| Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications | 2005-05-17 | Paper |
| Optimal spanners for axis-aligned rectangles | 2005-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829028 | 2004-11-29 | Paper |
| The structure and number of global roundings of a graph | 2004-10-27 | Paper |
| PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044554 | 2004-08-11 | Paper |
| Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4424281 | 2003-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418982 | 2003-07-31 | Paper |
| \(k\)-levels of concave surfaces | 2003-04-27 | Paper |
| Group symmetry in interior-point methods for semidefinite program | 2003-03-12 | Paper |
| Approximating uniform triangular meshes in polygons. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4438290 | 2003-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548794 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547807 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766811 | 2002-07-01 | Paper |
| Resource Constrained Chain Scheduling of UET Jobs on Two Machines | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331296 | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511235 | 2001-12-05 | Paper |
| A unified scheme for detecting fundamental curves in binary edge images | 2001-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526992 | 2001-02-28 | Paper |
| LMT-skeleton heuristics for several new classes of optimal triangulations | 2001-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761858 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761955 | 2001-02-21 | Paper |
| A new approximation algorithm for the capacitated vehicle routing problem on a tree | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952691 | 2000-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247449 | 2000-10-10 | Paper |
| Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints | 2000-09-10 | Paper |
| Efficient algorithms for finding the most vital edge of a minimum spanning tree | 2000-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937204 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4935169 | 2000-01-30 | Paper |
| Finding Subsets Maximizing Minimum Structures | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249536 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252328 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230364 | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218403 | 1998-11-11 | Paper |
| Triangulations intersect nicely | 1997-02-18 | Paper |
| Variants for the Hough transform for line detection | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875174 | 1996-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886044 | 1996-08-22 | Paper |
| A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms | 1996-07-07 | Paper |
| FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE | 1995-08-22 | Paper |
| On minimum and maximum spanning trees of linearly moving points | 1995-03-20 | Paper |
| Efficient algorithms for minimum range cut problems | 1994-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4286721 | 1994-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037409 | 1993-05-18 | Paper |
| A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control | 1993-05-16 | Paper |
| An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion | 1992-06-28 | Paper |
| A fully polynomial time approximation scheme for minimum cost-reliability ratio problems | 1992-06-28 | Paper |
| Optimal strategies for some team games | 1992-06-28 | Paper |
| A two‐commodity sharing problem on networks | 1992-06-25 | Paper |
| Finding k points with minimum diameter and related problems | 1991-01-01 | Paper |
| AN ε-APPROXIMATION SCHEME FOR MINIMUM VARIANCE PROBLEMS | 1990-01-01 | Paper |
| Mathematical Considerations on the Relationship between the Ordering of players and Winning Probability in Certain Types of Team Sports | 1989-01-01 | Paper |
| The Fair Resource Allocation Problem with Submodular Constraints | 1988-01-01 | Paper |
| Approximation algorithms for combinatorial fractional programming problems | 1987-01-01 | Paper |
| A cautious scheduler for multistep transactions | 1987-01-01 | Paper |
| A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program | 1987-01-01 | Paper |
| VARIANCE CONSTRAINED MARKOV DECISION PROCESS | 1987-01-01 | Paper |
| An efficient algorithm for the parametric resource allocation problem | 1985-01-01 | Paper |
| An Algorithm for the Equipollent Resource Allocation Problem | 1985-01-01 | Paper |
| Cautious transaction schedulers with admission control | 1985-01-01 | Paper |
| On-line computation of transitive closures of graphs | 1983-01-01 | Paper |
| A polynomial time algorithm for a chance-constrained single machine scheduling problem | 1983-01-01 | Paper |
| An efficient algorithm for K shortest simple paths | 1982-01-01 | Paper |
| An Algorithm for Finding K Minimum Spanning Trees | 1981-01-01 | Paper |
| An Algorithm for the K Best Solutions of the Resource Allocation Problem | 1981-01-01 | Paper |
| Notes on the Problem of the Allocation of Resources to Activities in Discrete Quantities | 1980-01-01 | Paper |
| ALGORITHMS FOR A VARIANT OF THE RESOURCE ALLOCATION PROBLEM | 1979-01-01 | Paper |
| A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function | 1979-01-01 | Paper |
