| Publication | Date of Publication | Type |
|---|
| Leanness computation: small values and special graph classes | 2024-09-17 | Paper |
| Finding the \(k\) shortest simple paths: time and space trade-offs | 2024-07-26 | Paper |
| Computing graph hyperbolicity using dominating sets | 2024-05-24 | Paper |
| Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation | 2024-04-14 | Paper |
| Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs | 2019-11-25 | Paper |
| Low time complexity algorithms for path computation in Cayley graphs | 2019-03-28 | Paper |
| On distance-preserving elimination orderings in graphs: complexity and algorithms | 2018-05-24 | Paper |
| Computing and maximizing the exact reliability of wireless backhaul networks | 2018-04-11 | Paper |
| Revisiting Decomposition by Clique Separators | 2018-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608071 | 2018-03-15 | Paper |
| A simple approach for lower-bounding the distortion in any hyperbolic embedding | 2018-01-18 | Paper |
| Applying clique-decomposition for computing Gromov hyperbolicity | 2017-08-24 | Paper |
| Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth | 2017-06-16 | Paper |
| Bin Packing with Colocations | 2017-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965980 | 2017-03-03 | Paper |
| Robust energy-aware routing with redundancy elimination | 2016-11-17 | Paper |
| On computing the Gromov hyperbolicity | 2016-10-24 | Paper |
| On the hyperbolicity of bipartite graphs and intersection graphs | 2016-09-30 | Paper |
| To Approximate Treewidth, Use Treelength! | 2016-07-22 | Paper |
| Data center interconnection networks are not hyperbolic | 2016-06-30 | Paper |
| On Computing the Hyperbolicity of Real-World Graphs | 2015-11-19 | Paper |
| Non-deterministic graph searching in trees | 2015-05-18 | Paper |
| Finding disjoint paths in networks with star shared risk link groups | 2015-05-18 | Paper |
| Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks | 2015-01-26 | Paper |
| Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs | 2014-12-22 | Paper |
| Connectivity Inference in Mass Spectrometry Based Structure Determination | 2013-09-17 | Paper |
| On rerouting connection requests in networks with shared bandwidth | 2013-07-04 | Paper |
| GMPLS label space minimization through hypergraph layouts | 2012-08-10 | Paper |
| A distributed algorithm for computing the node search number in trees | 2012-04-26 | Paper |
| Tradeoffs in process strategy games with application in the WDM reconfiguration problem | 2011-09-12 | Paper |
| A chance-constrained model and cutting planes for fixed broadband wireless networks | 2011-09-09 | Paper |
| Characterization of graphs and digraphs with small process numbers | 2011-08-10 | Paper |
| Designing hypergraph layouts to GMPLS routing strategies | 2010-02-24 | Paper |
| Traffic Grooming: Combinatorial Results and Practical Resolutions | 2010-02-09 | Paper |
| Edge-simple circuits through 10 ordered vertices in square grids | 2009-12-11 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Traffic grooming on the path | 2007-10-02 | Paper |
| Pathwidth of outerplanar graphs | 2007-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424723 | 2007-03-05 | Paper |
| Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6 | 2006-06-01 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| On DRC‐covering of Kn by cycles | 2003-04-03 | Paper |
| Isomorphisms of the De Bruijn digraph and free‐space optical networks | 2002-12-17 | Paper |
