| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6075894 | 2023-09-20 | Paper |
| List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs | 2023-05-17 | Paper |
| Parameterised temporal exploration problems | 2023-04-21 | Paper |
| Non-strict Temporal Exploration | 2022-09-01 | Paper |
| Exploration of \(k\)-edge-deficient temporal graphs | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091037 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091058 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092344 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090502 | 2022-07-18 | Paper |
| Car-sharing between two locations: online scheduling with flexible advance bookings | 2022-03-28 | Paper |
| Exploration of \(k\)-edge-deficient temporal graphs | 2022-03-25 | Paper |
| Algorithms that access the input via queries | 2022-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005137 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005152 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993294 | 2021-06-15 | Paper |
| ``Green barrier coverage with mobile sensors | 2021-03-09 | Paper |
| An adversarial model for scheduling with testing | 2020-11-11 | Paper |
| On the fast delivery problem with one or two packages | 2020-10-23 | Paper |
| A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity | 2020-07-20 | Paper |
| An efficient algorithm for the fast delivery problem | 2020-01-30 | Paper |
| Complexity and online algorithms for minimum skyline coloring of intervals | 2019-08-09 | Paper |
| Algorithms for Queryable Uncertainty | 2019-04-26 | Paper |
| Car-sharing between two locations: online scheduling with flexible advance bookings | 2018-10-04 | Paper |
| Computing and scheduling with explorable uncertainty | 2018-09-06 | Paper |
| Constrained bipartite edge coloring with applications to wavelength routing | 2018-07-04 | Paper |
| Online algorithms for non-preemptive speed scaling on power-heterogeneous processors | 2018-03-26 | Paper |
| Complexity and online algorithms for minimum skyline coloring of intervals | 2018-03-26 | Paper |
| Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width | 2016-04-04 | Paper |
| Further Results on Capacitated Network Design Games | 2015-11-04 | Paper |
| Computational complexity of traffic hijacking under BGP and S-BGP | 2015-09-16 | Paper |
| Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth | 2015-01-13 | Paper |
| Length-bounded cuts and flows | 2014-09-09 | Paper |
| Broadcast scheduling | 2014-09-09 | Paper |
| Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost | 2013-06-07 | Paper |
| Trimming of Graphs, with Application to Point Labeling | 2013-03-19 | Paper |
| Computational Complexity of Traffic Hijacking under BGP and S-BGP | 2012-11-01 | Paper |
| Approximating Multiobjective Knapsack Problems | 2012-02-19 | Paper |
| Connectivity Measures for Internet Topologies on the Level of Autonomous Systems | 2011-11-24 | Paper |
| Trimming of graphs, with application to point labeling | 2010-10-06 | Paper |
| PTAS for Weighted Set Cover on Unit Squares | 2010-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579403 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579437 | 2010-08-06 | Paper |
| Online Capacitated Interval Coloring | 2010-06-01 | Paper |
| A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs | 2010-05-11 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Discovery of network properties with all-shortest-paths queries | 2010-04-06 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Variable sized online interval coloring with bandwidth | 2009-06-17 | Paper |
| Length-Bounded Cuts and Flows | 2009-03-12 | Paper |
| Routing to reduce the cost of wavelength conversion | 2009-03-09 | Paper |
| Approximate Discovery of Random Graphs | 2009-03-05 | Paper |
| Online Capacitated Interval Coloring | 2009-03-03 | Paper |
| Discovery of Network Properties with All-Shortest-Paths Queries | 2008-07-10 | Paper |
| Cuts and Disjoint Paths in the Valley-Free Path Model | 2008-04-29 | Paper |
| Domination in Geometric Intersection Graphs | 2008-04-15 | Paper |
| Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow | 2008-03-14 | Paper |
| Independence and Coloring Problems on Intersection Graphs of Disks | 2008-03-14 | Paper |
| NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow | 2007-12-20 | Paper |
| An improved randomized on-line algorithm for a weighted interval selection problem | 2007-12-20 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Variable Sized Online Interval Coloring with Bandwidth | 2007-09-07 | Paper |
| Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs | 2007-08-28 | Paper |
| Call control in rings | 2007-04-26 | Paper |
| An algorithmic view on OVSF code assignment | 2007-04-26 | Paper |
| Path problems in generalized stars, complete graphs, and brick wall graphs | 2006-04-28 | Paper |
| Wavelength conversion in all-optical networks with shortest-path routing | 2006-03-21 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Network Analysis | 2005-11-11 | Paper |
| Network Analysis | 2005-11-11 | Paper |
| Polynomial-Time Approximation Schemes for Geometric Intersection Graphs | 2005-09-16 | Paper |
| A memetic algorithm to schedule planned maintenance for the national grid | 2005-08-04 | Paper |
| Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees | 2005-08-04 | Paper |
| Conversion of coloring algorithms into maximum weight independent set algorithms | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673408 | 2005-04-29 | Paper |
| Call control with \(k\) rejections | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3045823 | 2004-08-12 | Paper |
| Call Control with k Rejections | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044357 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737208 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472496 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474107 | 2004-08-04 | Paper |
| Algorithmic complexity of protein identification: Combinatorics of weighted strings | 2004-02-14 | Paper |
| Interval selection: Applications, algorithms, and lower bounds | 2003-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418643 | 2003-08-11 | Paper |
| On-line coloring of geometric intersection graphs | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782743 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779157 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778541 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778556 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768362 | 2002-07-22 | Paper |
| Routing flow through a strongly connected graph | 2002-05-21 | Paper |
| The Maximum Edge-Disjoint Paths Problem in Bidirected Trees | 2001-11-11 | Paper |
| Parallel load balancing for problems with good bisectors | 2001-09-03 | Paper |
| The complexity of path coloring and call scheduling | 2001-08-20 | Paper |
| Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries | 2001-08-20 | Paper |
| Optimal wavelength routing on directed fiber trees | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4702950 | 1999-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703851 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395324 | 1998-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373682 | 1998-06-23 | Paper |
