| Publication | Date of Publication | Type |
|---|
| Complexity and approximability of certain bicriteria location problems | 2024-02-28 | Paper |
| On multi-label linear interval routing schemes | 2024-01-05 | Paper |
| Hierarchically specified unit disk graphs | 2024-01-05 | Paper |
| Compact location problems with budget and communication constraints | 2023-12-12 | Paper |
| A Framework for Simulating Multiple Contagions Over Multiple Networks | 2022-11-15 | Paper |
| Effect of Peer Influence and Looting Concerns on Evacuation Behavior During Natural Disasters | 2022-11-15 | Paper |
| Agent-Based Modeling, Mathematical Formalism for | 2021-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115465 | 2020-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3300230 | 2020-07-28 | Paper |
| The complexity of approximating PSPACE-complete problems for hierarchical specifications | 2019-03-29 | 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 |
| Improving spanning trees by upgrading nodes | 2018-07-04 | Paper |
| Inferring local transition functions of discrete dynamical systems from observations of system behavior | 2017-06-19 | Paper |
| Optimization of Latency Insensitive Systems Through Back Pressure Minimization | 2017-05-16 | Paper |
| Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems | 2015-09-23 | Paper |
| Many birds with one stone | 2015-05-07 | 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 |
| 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 |
| Complexity of reachability problems for finite discrete dynamical systems | 2006-12-07 | Paper |
| Obtaining online approximation algorithms for facility dispersion from offline algorithms | 2006-09-12 | Paper |
| Local base station assignment with time intervals in mobile computing environments | 2004-08-16 | 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/Q4451017 | 2004-02-22 | 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/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/Q4331197 | 2002-06-10 | Paper |
| Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times | 2002-05-14 | 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/Q2721983 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262692 | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708233 | 2001-04-17 | Paper |
| Approximation algorithms for degree-constrained minimum-cost network-design problems | 2001-01-01 | Paper |
| Alarm placement in systems with fault propagation | 2000-08-21 | Paper |
| Facility dispersion problems under capacity and cost constraints | 2000-06-05 | Paper |
| Improving Minimum Cost Spanning Trees by Upgrading Nodes | 2000-02-06 | Paper |
| Algorithms for Path-Based Placement of Inspection Stations on Networks | 2000-01-01 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4395331 | 1998-08-04 | Paper |
| Compact location problems | 1998-07-22 | Paper |
| NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs | 1998-04-26 | Paper |
| Early comparison and decision strategies for datapaths that recover from transient faults | 1997-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4356444 | 1997-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128917 | 1997-08-04 | Paper |
| On approximation algorithms for the minimum satisfiability problem | 1997-02-27 | Paper |
| On Multi-Label Linear Interval Routing Schemes | 1996-10-30 | 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 |
| Heuristic and Special Case Algorithms for Dispersion Problems | 1995-01-31 | Paper |
| Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors | 1995-01-19 | Paper |
| Determining performance measures of algorithm-based fault tolerant systems | 1994-03-22 | Paper |
| Construction of check sets for algorithm-based fault tolerance | 1994-01-01 | Paper |
| Graph theoretic analysis of PLA folding heuristics | 1993-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037432 | 1993-05-18 | Paper |
| An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains | 1989-01-01 | Paper |
| On the orderability problem for PLA folding | 1989-01-01 | Paper |
| The Complexity of Near-Optimal Programmable Logic Array Folding | 1988-01-01 | Paper |
| An application of the planar separator theorem to counting problems | 1987-01-01 | Paper |
| One-layer routing without component constraints | 1984-01-01 | Paper |
