| Publication | Date of Publication | Type |
|---|
| Shortest path network interdiction with asymmetric uncertainty | 2024-03-15 | Paper |
| Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs | 2023-03-03 | Paper |
| Probing a set of trajectories to maximize captured information | 2023-02-07 | Paper |
| Scheduling jobs that arrive over time | 2022-12-16 | Paper |
| Task scheduling in networks | 2022-12-09 | Paper |
| An analysis of multiple contaminant warning system design objectives for sensor placement optimization in water distribution networks | 2022-10-25 | Paper |
| Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? | 2021-04-26 | Paper |
| Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs | 2020-10-14 | Paper |
| Making social networks more human: A topological approach | 2020-10-14 | Paper |
| Geometric hitting set for segments of few orientations | 2018-04-12 | Paper |
| Why do simple algorithms for triangle enumeration work in the real world? | 2017-05-19 | Paper |
| Geometric hitting set for segments of few orientations | 2016-02-26 | Paper |
| PEBBL: an object-oriented framework for scalable parallel branch and bound | 2016-01-15 | Paper |
| Finding minimum-quotient cuts in planar graphs | 2015-05-07 | Paper |
| The network inhibition problem | 2015-05-07 | Paper |
| Sleeping on the job | 2014-12-12 | Paper |
| Sleeping on the job: energy-efficient and robust broadcast for radio networks | 2011-11-07 | Paper |
| Communication-aware processor allocation for supercomputers: Finding point sets of small average distance | 2008-04-03 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Robust optimization of contaminant sensor placement for community water systems | 2006-06-14 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818873 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452913 | 2004-03-07 | Paper |
| Analyzing the multiple-target-multiple-agent scenario using optimal assignment algorithms | 2003-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536959 | 2002-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768018 | 2002-04-09 | Paper |
| Optimal time-critical scheduling via resource augmentation | 2002-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526977 | 2001-02-28 | Paper |
| Off-line admission control for general scheduling problems | 2001-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952606 | 2000-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952713 | 2000-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228474 | 2000-05-28 | Paper |
| Approximation algorithms for the fixed-topology phylogenetic number problem | 2000-02-07 | Paper |
| Constructing Evolutionary Trees in the Presence of Polymorphic Characters | 1999-10-28 | Paper |
| Minimizing average completion time in the presence of release dates | 1999-06-03 | Paper |
| Improved bounds on relaxations of a parallel machine scheduling problem | 1999-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375729 | 1998-12-14 | Paper |
| Constructing Computer Virus Phylogenies | 1998-02-09 | Paper |
| Task Scheduling in Networks | 1998-02-09 | Paper |
| Minimizing phylogenetic number to find good evolutionary trees | 1998-02-02 | Paper |
| The asymmetric median tree. --- A new model for building consensus trees | 1997-08-11 | Paper |
