| Publication | Date of Publication | Type |
|---|
| Steiner problems on directed acyclic graphs | 2024-01-29 | Paper |
| Optimal bi-level augmentation for selective! enhancing graph connectivity with applications | 2024-01-29 | Paper |
| Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract) | 2023-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874307 | 2023-02-07 | Paper |
| Graph searching on chordal graphs | 2023-01-25 | Paper |
| Bounds and algorithms for a practical task allocation model (extended abstract) | 2023-01-25 | Paper |
| Optimal augmentation for bipartite componentwise biconnectivity in linear time | 2023-01-25 | Paper |
| Task allocation on a network of processors | 2018-07-09 | Paper |
| Finding Articulation Points of Large Graphs in Linear Time | 2015-10-30 | Paper |
| A Quantitative Study of $$2 \times 4$$ Chinese Dark Chess | 2015-09-29 | Paper |
| Automatic Generation of Opening Books for Dark Chess | 2015-09-29 | Paper |
| A logical framework for privacy-preserving social network publication | 2014-04-24 | Paper |
| Knowledge Abstraction in Chinese Chess Endgame Databases | 2011-02-11 | Paper |
| Heterogeneous Subset Sampling | 2010-07-20 | Paper |
| The bridge-connectivity augmentation problem with a partition constraint | 2010-07-07 | Paper |
| Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) | 2009-12-17 | Paper |
| Smallest bipartite bridge-connectivity augmentation | 2009-08-27 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| A GrC-Based Approach to Social Network Data Protection | 2008-11-13 | Paper |
| Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract) | 2008-01-04 | Paper |
| Value versus damage of information release: a data privacy perspective | 2006-12-07 | Paper |
| Data and Applications Security XIX | 2006-11-01 | Paper |
| Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time | 2006-06-01 | Paper |
| The Hamiltonian problem on distance-hereditary graphs | 2006-04-28 | Paper |
| Two variations of the minimum Steiner problem | 2005-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808624 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448390 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408432 | 2003-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484250 | 2003-06-12 | Paper |
| Simpler and faster biconnectivity augmentation | 2003-05-14 | Paper |
| Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536682 | 2002-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753943 | 2001-11-11 | Paper |
| A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs | 2000-10-04 | Paper |
| On Four-Connecting a Triconnected Graph | 2000-06-05 | Paper |
| A unifying augmentation algorithm for two-edge connectivity and biconnectivity | 1999-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249531 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230328 | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218426 | 1999-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218431 | 1998-11-11 | Paper |
| Scheduling problems in a practical allocation model | 1997-12-17 | Paper |
| Efficient massively parallel implementation of some combinatorial algorithms | 1997-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352827 | 1997-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763330 | 1995-04-11 | Paper |
| Finding a Smallest Augmentation to Biconnect a Graph | 1994-01-04 | Paper |
