| Publication | Date of Publication | Type |
|---|
| A new graph parameter to measure linearity | 2023-10-12 | Paper |
| Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension | 2022-11-15 | Paper |
| A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs | 2022-06-13 | Paper |
| The generalized kudryashov method for new closed form traveling wave solutions to some NLEEs | 2022-04-21 | Paper |
| Fast Diameter Computation within Split Graphs | 2022-01-27 | Paper |
| Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs | 2021-06-29 | Paper |
| Graph Classes and Forbidden Patterns on Three Vertices | 2021-03-18 | Paper |
| Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension | 2021-02-02 | Paper |
| Maximum Induced Matching Algorithms via Vertex Ordering Characterizations | 2020-11-25 | Paper |
| Approximating modular decomposition is hard | 2020-07-21 | Paper |
| Fast diameter computation within split graphs | 2020-05-13 | Paper |
| Maximum induced matching algorithms via vertex ordering characterizations | 2020-04-09 | Paper |
| A general algorithmic scheme for modular decompositions of hypergraphs and applications | 2020-02-25 | Paper |
| Fast approximation of centrality and distances in hyperbolic graphs | 2019-10-11 | Paper |
| Fast approximation of eccentricities and distances in hyperbolic graphs | 2019-07-12 | Paper |
| When an optimal dominating set with given constraints exists | 2019-06-06 | Paper |
| Representation of lattices via set-colored posets | 2018-10-23 | Paper |
| A new graph parameter to measure linearity | 2018-03-26 | Paper |
| A new LBFS-based algorithm for cocomparability graph recognition | 2016-11-24 | Paper |
| Into the square: on the complexity of some quadratic-time solvable problems | 2016-08-05 | Paper |
| On the Power of Graph Searching for Cocomparability Graphs | 2016-04-07 | Paper |
| Algorithmic aspects of switch cographs | 2016-01-21 | Paper |
| A tie-break model for graph search | 2015-12-10 | Paper |
| Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs | 2015-09-09 | Paper |
| Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs | 2015-05-26 | Paper |
| PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT | 2015-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982366 | 2015-04-09 | Paper |
| Computing \(H\)-joins with application to 2-modular decomposition | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2928580 | 2014-11-10 | Paper |
| A survey of the algorithmic aspects of modular decomposition | 2014-10-07 | Paper |
| Reinsurance or securitization: the case of natural catastrophe risk | 2014-09-08 | Paper |
| Fast computation of empirically tight bounds for the diameter of massive graphs | 2014-04-01 | Paper |
| On computing the diameter of real-world undirected graphs | 2013-12-11 | Paper |
| A Decomposition Theorem for Chordal Graphs and its Applications | 2013-10-10 | Paper |
| LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs | 2013-09-25 | Paper |
| Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage | 2013-07-04 | Paper |
| On some simplicial elimination schemes for chordal graphs | 2013-07-04 | Paper |
| Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs | 2013-06-28 | Paper |
| Detecting 2-joins faster | 2013-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4918389 | 2013-04-24 | Paper |
| Unique perfect phylogeny is intractable | 2013-04-17 | Paper |
| The arboreal jump number of an order | 2013-03-20 | Paper |
| Skills, core capabilities, and the choice between merging, allying, and trading assets | 2013-03-06 | Paper |
| Algorithms for Some H-Join Decompositions | 2012-06-29 | Paper |
| Polynomial-time recognition of clique-width \(\leq 3\) graphs | 2012-05-11 | Paper |
| Tree-representation of set families and applications to combinatorial decompositions | 2012-05-04 | Paper |
| Reduced clique graphs of chordal graphs | 2012-05-04 | Paper |
| Additive spanners and distance and routing labeling schemes for hyperbolic graphs | 2012-04-26 | Paper |
| Unique Perfect Phylogeny Is NP-Hard | 2011-06-29 | Paper |
| Complexity issues for the sandwich homogeneous set problem | 2011-04-19 | Paper |
| A note on computing set overlap classes | 2010-06-09 | Paper |
| On transitive orientations with restricted covering graphs | 2010-01-29 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| A Simple Linear Time LexBFS Cograph Recognition Algorithm | 2009-11-27 | Paper |
| Polynomial-Time Algorithm for the Leafage of Chordal Graphs | 2009-10-29 | Paper |
| Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time | 2009-07-07 | Paper |
| A note on finding all homogeneous set sandwiches | 2009-04-28 | Paper |
| Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs | 2009-02-12 | Paper |
| Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms | 2008-09-04 | Paper |
| Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations | 2008-08-28 | Paper |
| Unifying Two Graph Decompositions with Modular Decomposition | 2008-05-27 | Paper |
| Competitive graph searches | 2008-04-15 | Paper |
| On Modular Decomposition Concepts: the case for Homogeneous Relations | 2007-05-29 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| The number of Moore families on \(n=6\) | 2005-06-10 | Paper |
| A simple linear time algorithm for cograph recognition | 2005-02-22 | Paper |
| Computational aspects of the 2-dimension of partially ordered sets | 2004-10-27 | Paper |
| Heat transfer to pulsating turbulent flow in an abrupt pipe expansion | 2004-03-07 | Paper |
| Monitoring, Implicit Contracting, and the Lack of Permanence of Leveraged Buyouts | 2003-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331190 | 2002-09-26 | Paper |
| Diameter determination on restricted graph families | 2002-08-14 | Paper |
| Efficient algorithms on distributive lattices | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508369 | 2001-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525257 | 2001-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954442 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253831 | 1999-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281647 | 1999-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232788 | 1999-04-26 | Paper |
| Calculation of turblent flow and heat transfer in periodically converging-diverging channels | 1999-02-16 | Paper |
| Underpricing and IPO proceeds: a note | 1999-01-12 | Paper |
| Gray Codes for the Ideals of Interval Orders | 1998-01-07 | Paper |
| Tree structure for distributive lattices and its applications | 1997-09-18 | Paper |
| Fluid flow and heat transfer characteristics in axisymmetric annular diffusers | 1997-05-14 | Paper |
| Models of information aggregation in financial markets: a review | 1996-01-01 | Paper |
| Treewidth of cocomparability graphs and a new order-theoretic parameter | 1994-11-10 | Paper |
| On the Interplay Between Interval Dimension and Dimension | 1994-10-25 | Paper |
| Interval dimension and MacNeille completion | 1994-03-27 | Paper |
| On the calculation of transitive reduction-closure of orders | 1994-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028118 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360916 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3823821 | 1989-01-01 | Paper |
| Computing the bump number is easy | 1988-01-01 | Paper |
| NP-completeness properties about linear extensions | 1987-01-01 | Paper |
| On some complexity properties of N-free posets and posets with bounded decomposition diameter | 1987-01-01 | Paper |
| On the greedy dimension of a partial order | 1985-01-01 | Paper |
| 1-intersecting families | 1985-01-01 | Paper |
| N-free posets as generalizations of series-parallel posets | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5184948 | 1984-01-01 | Paper |
| On linear k-arboricity | 1984-01-01 | Paper |
| Jump number of dags having Dilworth number 2 | 1984-01-01 | Paper |
| La k-Arboricité Linéaire Des Arbres | 1983-01-01 | Paper |
| Some problems about linear arboricity | 1982-01-01 | Paper |
| Partitive hypergraphs | 1981-01-01 | Paper |
| The Jump Number of Dags and Posets: An Introduction | 1980-01-01 | Paper |
| A Construction Method For Minimally K-Edge-Connected Graphs | 1980-01-01 | Paper |
| On the X-join decomposition for undirected graphs | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3859805 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4175590 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4099668 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4108357 | 1975-01-01 | Paper |
