| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126509 | 2024-04-09 | Paper |
| Financial spillovers and macroprudential policies | 2021-04-08 | Paper |
| Twenty years of progress of \(\mathrm{JCDCG}^3\) | 2020-04-03 | Paper |
| Cookie clicker | 2020-04-03 | Paper |
| On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs | 2020-03-06 | Paper |
| A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique | 2019-04-26 | Paper |
| Bumpy pyramid folding | 2018-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606322 | 2018-03-02 | Paper |
| How to Solve the Cake-Cutting Problem in Sublinear Time | 2017-07-17 | Paper |
| Number of Ties and Undefeated Signs in a Generalized Janken | 2017-02-01 | Paper |
| On computational complexity of graph inference from counting | 2016-04-06 | Paper |
| Folding a paper strip to minimize thickness | 2016-02-18 | Paper |
| Testing outerplanarity of bounded degree graphs | 2015-09-03 | Paper |
| Generalized river crossing problems | 2015-05-29 | Paper |
| Folding a Paper Strip to Minimize Thickness | 2015-02-27 | Paper |
| An improved constant-time approximation algorithm for maximum~matchings | 2015-02-04 | Paper |
| Enumeration of isolated cliques and pseudo-cliques | 2014-11-18 | Paper |
| Testing \(k\)-edge-connectivity of digraphs | 2014-11-11 | Paper |
| The complexity of the stamp folding problem | 2014-01-10 | Paper |
| How to Generalize Janken – Rock-Paper-Scissors-King-Flea | 2013-12-06 | Paper |
| Helly numbers of polyominoes | 2013-09-26 | Paper |
| Constant-Time Algorithms for Sparsity Matroids | 2013-08-12 | Paper |
| Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems | 2012-11-29 | Paper |
| Algorithms and Complexity of Generalized River Crossing Problems | 2012-08-22 | Paper |
| An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems | 2012-07-16 | Paper |
| Constant-Time Approximation Algorithms for the Knapsack Problem | 2012-07-16 | Paper |
| Property testing on \(k\)-vertex-connectivity of graphs | 2012-04-26 | Paper |
| Arrangements of \(n\) points whose incident-line-numbers are at most \(n/2\) | 2012-01-24 | Paper |
| Making Polygons by Simple Folds and One Straight Cut | 2011-11-11 | Paper |
| Complexity of the Stamp Folding Problem | 2011-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084818 | 2011-03-25 | Paper |
| Testing Outerplanarity of Bounded Degree Graphs | 2010-09-10 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Maximum-cover source location problems with objective edge-connectivity three | 2009-09-09 | Paper |
| The Multi-Commodity Source Location Problems and the Price of Greed | 2009-05-19 | Paper |
| Transforming Graphs with the Same Degree Sequence | 2009-01-13 | Paper |
| Property Testing on k-Vertex-Connectivity of Graphs | 2008-08-28 | Paper |
| Multi-commodity Source Location Problems and Price of Greed | 2008-03-25 | Paper |
| Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon | 2008-03-18 | Paper |
| Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order | 2007-08-28 | Paper |
| Infinite Series of Generalized Gosper Space Filling Curves | 2007-08-28 | Paper |
| Winning ways of weighted poset games | 2007-07-19 | Paper |
| Semi-distance codes and Steiner systems | 2007-07-19 | Paper |
| Subdivision of the hierarchy of H-colorable graph classes by circulant graphs | 2007-05-29 | Paper |
| Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three | 2007-05-29 | Paper |
| Two equivalent measures on weighted hypergraphs | 2007-01-09 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Linear time algorithms for graph search and connectivity determination on complement graphs. | 2006-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673413 | 2005-04-29 | Paper |
| NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization) | 2005-04-23 | Paper |
| Single backup table schemes for shortest-path routing | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4664045 | 2005-04-05 | Paper |
| Avoiding routing loops on the internet | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472509 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427866 | 2003-09-14 | Paper |
| Sum of edge lengths of a multigraph drawn on a convex polygon | 2003-04-28 | Paper |
| Source location problems considering vertex-connectivity and edge-connectivity simultaneously | 2002-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548313 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547802 | 2002-08-21 | Paper |
| Minimum cost source location problem with vertex-connectivity requirements in digraphs | 2002-07-25 | Paper |
| Edge connectivity between nodes and node-subsets | 2002-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504020 | 2001-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761868 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504021 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937876 | 2000-02-20 | Paper |
