| Publication | Date of Publication | Type |
|---|
| Complexity and approximability of certain bicriteria location problems | 2024-02-28 | Paper |
| Hierarchically specified unit disk graphs | 2024-01-05 | Paper |
| Compact location problems with budget and communication constraints | 2023-12-12 | Paper |
| Service-constrained network design problems | 2022-12-09 | Paper |
| Formal language constrained path problems | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115465 | 2020-08-13 | Paper |
| The complexity of approximating PSPACE-complete problems for hierarchical specifications | 2019-03-29 | Paper |
| Calibrating a Stochastic, Agent-Based Model Using Quantile-Based Emulation | 2019-01-21 | Paper |
| Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results | 2019-01-17 | Paper |
| Bicriteria Network Design Problems | 2019-01-10 | Paper |
| A characterization of nested canalyzing functions with maximum average sensitivity | 2018-12-03 | Paper |
| Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4686061 | 2018-10-09 | Paper |
| Improving spanning trees by upgrading nodes | 2018-07-04 | Paper |
| Point set labeling with specified positions | 2017-09-29 | Paper |
| Inferring local transition functions of discrete dynamical systems from observations of system behavior | 2017-06-19 | Paper |
| Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures | 2017-02-03 | Paper |
| Labeled cuts in graphs | 2016-09-12 | Paper |
| Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version) | 2016-09-01 | Paper |
| A unified approach to scheduling on unrelated parallel machines | 2015-11-11 | Paper |
| Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems | 2015-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501791 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501331 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501366 | 2015-08-03 | Paper |
| Many birds with one stone | 2015-05-07 | Paper |
| I <scp>ndemics</scp> | 2015-03-05 | Paper |
| Adversarial scheduling in discrete models of social dynamics | 2012-10-23 | Paper |
| Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems | 2011-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574272 | 2010-07-09 | Paper |
| Scheduling on unrelated machines under tree-like precedence constraints | 2009-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3597159 | 2009-02-09 | Paper |
| Engineering Label-Constrained Shortest-Path Algorithms | 2008-07-10 | Paper |
| Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion | 2008-06-19 | Paper |
| Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems. | 2008-05-19 | Paper |
| Predecessor existence problems for finite discrete dynamical systems | 2007-10-25 | Paper |
| Budget constrained minimum cost connected medians | 2007-04-26 | Paper |
| Complexity of reachability problems for finite discrete dynamical systems | 2006-12-07 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Provable algorithms for parallel generalized sweep scheduling | 2006-06-30 | Paper |
| A memetic algorithm to schedule planned maintenance for the national grid | 2005-08-04 | Paper |
| An experimental study of a simple, distributed edge-coloring algorithm | 2005-08-04 | Paper |
| POINT SET LABELING WITH SPECIFIED POSITIONS | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737140 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737207 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470517 | 2004-07-01 | Paper |
| On some special classes of sequential dynamical systems | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452913 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451017 | 2004-02-22 | Paper |
| Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry | 2003-11-30 | Paper |
| Reachability problems for sequential dynamical systems with threshold functions. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414508 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411352 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785459 | 2003-03-10 | Paper |
| Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785582 | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766688 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331197 | 2002-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768370 | 2002-03-24 | Paper |
| Models and approximation algorithms for channel assignment in radio networks | 2002-02-27 | Paper |
| Upgrading bottleneck constrained forests | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741527 | 2001-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527194 | 2001-09-06 | Paper |
| Approximation algorithms for maximum two-dimensional pattern matching | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721983 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527187 | 2001-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708233 | 2001-04-17 | Paper |
| Formal-Language-Constrained Path Problems | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952637 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952645 | 2000-05-10 | Paper |
| Improving Minimum Cost Spanning Trees by Upgrading Nodes | 2000-02-06 | Paper |
| Improving spanning trees by upgrading nodes | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258576 | 1999-09-13 | Paper |
| Approximation algorithms for certain network improvement problems | 1999-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232790 | 1999-03-15 | Paper |
| Modifying edges of a network to obtain short subgraphs | 1999-01-12 | Paper |
| Bicriteria Network Design Problems | 1998-12-02 | Paper |
| Hierarchically specified unit disk graphs | 1998-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359752 | 1998-10-12 | Paper |
| The Complexity of Planar Counting Problems | 1998-09-20 | Paper |
| Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems | 1998-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395331 | 1998-08-04 | Paper |
| Compact location problems | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395332 | 1998-06-11 | Paper |
| NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs | 1998-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375760 | 1998-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129923 | 1997-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128917 | 1997-08-04 | Paper |
| On approximation algorithms for the minimum satisfiability problem | 1997-02-27 | Paper |
| Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs | 1996-08-05 | Paper |
| Spanning Trees—Short or Small | 1996-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764625 | 1995-07-16 | Paper |
| Simple heuristics for unit disk graphs | 1995-06-12 | Paper |
| Generalized vertex covering in interval graphs | 1993-01-16 | Paper |
| An optimal algorithm to solve the all-pair shortest path problem on interval graphs | 1992-06-28 | Paper |
