| Publication | Date of Publication | Type |
|---|
| Detours in directed graphs | 2024-04-23 | Paper |
| Parameterized complexity of broadcasting in graphs | 2024-04-16 | Paper |
| FPT approximation and subexponential algorithms for covering few or many edges | 2024-03-13 | Paper |
| Diverse collections in matroids and graphs | 2024-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6146249 | 2024-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147415 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147518 | 2024-01-15 | Paper |
| Diverse Pairs of Matchings | 2023-11-14 | Paper |
| Recognizing Proper Tree-Graphs | 2023-11-13 | Paper |
| Parameterized Complexity of Directed Spanner Problems. | 2023-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059156 | 2023-11-02 | Paper |
| Low-Rank Binary Matrix Approximation in Column-Sum Norm. | 2023-10-31 | Paper |
| Combing a Linkage in an Annulus | 2023-10-26 | Paper |
| Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable | 2023-10-23 | Paper |
| On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves | 2023-10-04 | Paper |
| How to find a good explanation for clustering? | 2023-08-28 | Paper |
| Lossy kernelization of same-size clustering | 2023-08-17 | Paper |
| Parameterized Complexity of Feature Selection for Categorical Data Clustering. | 2023-08-08 | Paper |
| Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs | 2023-07-17 | Paper |
| Detours in directed graphs | 2023-07-10 | Paper |
| A survey of parameterized algorithms and the complexity of edge modification | 2023-06-20 | Paper |
| Parameterized complexity of categorical clustering with size constraints | 2023-06-12 | Paper |
| Kernelization of Whitney Switches | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874519 | 2023-02-07 | Paper |
| On the Complexity of Recovering Incidence Matrices | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874521 | 2023-02-07 | Paper |
| Clustering to Given Connectivities | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875577 | 2023-02-03 | Paper |
| Parameterized k-Clustering: Tractability Island | 2023-02-03 | Paper |
| Parameterization Above a Multiplicative Guarantee | 2023-02-03 | Paper |
| Lossy kernelization of same-size clustering | 2022-11-11 | Paper |
| Parameterized complexity of set-restricted disjoint paths on chordal graphs | 2022-11-11 | Paper |
| Graph square roots of small distance from degree one graphs | 2022-10-13 | Paper |
| Graph Hamiltonicity parameterized by proper interval deletion set | 2022-10-13 | Paper |
| Present-biased optimization | 2022-10-04 | Paper |
| Multiplicative Parameterization Above a Guarantee | 2022-09-24 | Paper |
| Partitioning \(H\)-free graphs of bounded diameter | 2022-08-25 | Paper |
| Parameterized complexity of directed spanner problems | 2022-08-03 | Paper |
| Graph square roots of small distance from degree one graphs | 2022-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091216 | 2022-07-21 | Paper |
| Computing Tree Decompositions with Small Independence Number | 2022-07-20 | Paper |
| Modification to Planarity is Fixed Parameter Tractable | 2022-07-18 | Paper |
| Acyclic, star, and injective colouring: bounding the diameter | 2022-06-13 | Paper |
| Acyclic, star, and injective colouring: bounding the diameter | 2022-06-08 | Paper |
| Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs | 2022-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075790 | 2022-05-11 | Paper |
| Parameterized Complexity of Elimination Distance to First-Order Logic Properties | 2022-04-29 | Paper |
| Cyclability in graph classes | 2022-03-28 | Paper |
| Parameterized complexity of categorical clustering with size constraints | 2022-03-25 | Paper |
| Longest Cycle above Erd\H{o}s-Gallai Bound | 2022-02-07 | Paper |
| Induced disjoint paths in AT-free graphs | 2021-11-25 | Paper |
| Compound Logics for Modification Problems | 2021-11-04 | Paper |
| Refined notions of parameterized enumeration kernels with applications to matching cut enumeration | 2021-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009589 | 2021-08-04 | Paper |
| Parameterized Low-Rank Binary Matrix Approximation | 2021-07-28 | Paper |
| Subexponential parameterized algorithms and kernelization on almost chordal graphs | 2021-06-30 | Paper |
| Kernelization of Whitney Switches | 2021-06-28 | Paper |
| Partitioning H-Free Graphs of Bounded Diameter | 2021-05-10 | Paper |
| Kernelization of Graph Hamiltonicity: Proper $H$-Graphs | 2021-04-28 | Paper |
| Acyclic, Star, and Injective Colouring: Bounding the Diameter | 2021-04-21 | Paper |
| Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable | 2021-02-02 | Paper |
| Parameterized \(k\)-clustering: tractability island | 2021-02-02 | Paper |
| Parameterized low-rank binary matrix approximation | 2021-01-15 | Paper |
| Going Far from Degeneracy | 2020-10-29 | Paper |
| Graph Square Roots of Small Distance from Degree One Graphs | 2020-10-12 | Paper |
| On the tractability of optimization problems on \(H\)-graphs | 2020-09-03 | Paper |
| Partial complementation of graphs | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116487 | 2020-08-25 | Paper |
| Finding connected secluded subgraphs | 2020-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111387 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111877 | 2020-05-27 | Paper |
| Structured Connectivity Augmentation | 2020-05-26 | Paper |
| Subgraph complementation | 2020-05-21 | Paper |
| Parameterized aspects of strong subgraph closure | 2020-05-21 | Paper |
| Enumeration of minimal connected dominating sets for chordal graphs | 2020-04-21 | Paper |
| On the parameterized complexity of graph modification to first-order logic properties | 2020-02-27 | Paper |
| Kernelization of graph Hamiltonicity: proper \(H\)-graphs | 2020-01-16 | Paper |
| Approximation Schemes for Low-rank Binary Matrix Approximation Problems | 2019-12-02 | Paper |
| Spanning Circuits in Regular Matroids | 2019-12-02 | Paper |
| Surjective H-colouring: New hardness results | 2019-10-28 | Paper |
| Editing to Connected F-Degree Graph | 2019-08-29 | Paper |
| Enumeration and maximum number of minimal dominating sets for chordal graphs | 2019-08-13 | Paper |
| Enumeration and maximum number of maximal irredundant sets for chordal graphs | 2019-07-17 | Paper |
| Planar Disjoint Paths in Linear Time | 2019-07-12 | Paper |
| Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 | 2019-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633895 | 2019-05-06 | Paper |
| Clique-width III | 2019-03-28 | Paper |
| Enumeration of maximal irredundant sets for claw-free graphs | 2018-12-04 | Paper |
| Covering Vectors by Spaces: Regular Matroids | 2018-11-19 | Paper |
| Structured Connectivity Augmentation | 2018-11-19 | Paper |
| Computing square roots of graphs with low maximum degree | 2018-09-17 | Paper |
| Finding cactus roots in polynomial time | 2018-08-03 | Paper |
| Spanning Circuits in Regular Matroids | 2018-07-16 | Paper |
| Output-polynomial enumeration on graphs of bounded (local) linear MIM-width | 2018-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607896 | 2018-03-15 | Paper |
| Editing to Connected f-Degree Graph | 2018-01-24 | Paper |
| Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 | 2018-01-04 | Paper |
| Enumeration and maximum number of maximal irredundant sets for chordal graphs | 2018-01-04 | Paper |
| Enumeration and maximum number of minimal connected vertex covers in graphs | 2017-11-14 | Paper |
| Parameterized complexity of superstring problems | 2017-11-09 | Paper |
| A Linear Kernel for Finding Square Roots of Almost Planar Graphs | 2017-10-17 | Paper |
| Parameterized complexity of secluded connectivity problems | 2017-10-12 | Paper |
| Variants of Plane Diameter Completion | 2017-09-29 | Paper |
| Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality | 2017-09-29 | Paper |
| Editing to a connected graph of given degrees | 2017-09-28 | Paper |
| On the tractability of optimization problems on H-graphs | 2017-09-27 | Paper |
| A linear kernel for finding square roots of almost planar graphs | 2017-09-07 | Paper |
| Surjective \(H\)-colouring: new hardness results | 2017-08-04 | Paper |
| Enumeration of Maximal Irredundant Sets for Claw-Free Graphs | 2017-07-21 | Paper |
| Parameterized Complexity of Secluded Connectivity Problems | 2017-07-13 | Paper |
| Metric Dimension of Bounded Tree-length Graphs | 2017-06-14 | Paper |
| Connecting Vertices by Independent Trees | 2017-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978505 | 2017-04-25 | Paper |
| A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs | 2017-04-21 | Paper |
| The Parameterized Complexity of Graph Cyclability | 2017-03-16 | Paper |
| Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs | 2017-02-21 | Paper |
| Squares of low clique number | 2017-02-14 | Paper |
| Graph editing to a given degree sequence | 2017-02-06 | Paper |
| Editing to a planar graph of given degrees | 2016-12-28 | Paper |
| Minimal dominating sets in interval graphs and trees | 2016-11-24 | Paper |
| On recognition of threshold tolerance graphs and their complements | 2016-11-24 | Paper |
| Graph editing to a fixed target | 2016-11-24 | Paper |
| Finding Cactus Roots in Polynomial Time | 2016-09-29 | Paper |
| Graph Editing to a Given Degree Sequence | 2016-07-25 | Paper |
| Induced disjoint paths in circular-arc graphs in linear time | 2016-07-05 | Paper |
| Enumerating minimal connected dominating sets in graphs of bounded chordality | 2016-05-02 | Paper |
| Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs | 2016-04-04 | Paper |
| Parameterized algorithms for finding square roots | 2016-03-29 | Paper |
| Parameterized complexity of the anchored \(k\)-core problem for directed graphs | 2016-03-10 | Paper |
| Output-polynomial enumeration on graphs of bounded (local) linear MIM-width | 2016-01-11 | Paper |
| Editing to Eulerian graphs | 2015-12-11 | Paper |
| How to hunt an invisible rabbit on a graph | 2015-12-11 | Paper |
| Enumerating minimal dominating sets in chordal bipartite graphs | 2015-12-10 | Paper |
| Editing to a Planar Graph of Given Degrees | 2015-10-20 | Paper |
| Metric Dimension of Bounded Width Graphs | 2015-09-16 | Paper |
| Editing to a graph of given degrees | 2015-09-15 | Paper |
| Hadwiger Number of Graphs with Small Chordality | 2015-09-09 | Paper |
| Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time | 2015-09-09 | Paper |
| Induced Disjoint Paths in Circular-Arc Graphs in Linear Time | 2015-09-09 | Paper |
| Minimizing Rosenthal potential in multicast games | 2015-09-04 | Paper |
| An incremental polynomial time algorithm to enumerate all minimal edge dominating sets | 2015-09-02 | Paper |
| Parameterized complexity of superstring problems | 2015-08-20 | Paper |
| Hadwiger Number of Graphs with Small Chordality | 2015-08-17 | Paper |
| Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs | 2015-07-23 | Paper |
| Editing to a graph of given degrees | 2015-07-13 | Paper |
| Modifying a graph using vertex elimination | 2015-05-21 | Paper |
| Induced Disjoint Paths in Claw-Free Graphs | 2015-05-20 | Paper |
| List coloring in the absence of a linear forest | 2015-03-02 | Paper |
| Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width | 2015-02-09 | Paper |
| Coloring graphs characterized by a forbidden subgraph | 2014-11-28 | Paper |
| Parameterized complexity of three edge contraction problems with degree constraints | 2014-11-14 | Paper |
| Editing to a Connected Graph of Given Degrees | 2014-10-14 | Paper |
| The Parameterized Complexity of Graph Cyclability | 2014-10-08 | Paper |
| Long Circuits and Large Euler Subgraphs | 2014-09-26 | Paper |
| Finding clubs in graph classes | 2014-08-22 | Paper |
| Lift-contractions | 2014-07-29 | Paper |
| Closing complexity gaps for coloring problems on \(H\)-free graphs | 2014-07-18 | Paper |
| Detecting fixed patterns in chordal graphs in polynomial time | 2014-07-03 | Paper |
| Parameterized Algorithms to Preserve Connectivity | 2014-07-01 | Paper |
| Solutions for the stable roommates problem with payments | 2014-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417642 | 2014-05-22 | Paper |
| Subset feedback vertex sets in chordal graphs | 2014-04-28 | Paper |
| Coloring graphs without short cycles and long induced paths | 2014-03-27 | Paper |
| List coloring in the absence of two subgraphs | 2014-02-18 | Paper |
| Parameterized complexity of connected even/odd subgraph problems | 2014-01-28 | Paper |
| Colouring of graphs with Ramsey-type forbidden subgraphs | 2014-01-24 | Paper |
| Graph Editing to a Fixed Target | 2014-01-17 | Paper |
| Detecting induced minors in AT-free graphs | 2014-01-09 | Paper |
| Tight complexity bounds for FPT subgraph problems parameterized by the clique-width | 2014-01-07 | Paper |
| Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints | 2013-12-10 | Paper |
| Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs | 2013-12-06 | Paper |
| Sparse Square Roots | 2013-12-06 | Paper |
| Colouring of Graphs with Ramsey-Type Forbidden Subgraphs | 2013-12-06 | Paper |
| Increasing the minimum degree of a graph by contractions | 2013-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857379 | 2013-11-01 | Paper |
| On the Parameterized Complexity of Cutting a Few Vertices from a Graph | 2013-09-20 | Paper |
| Long Circuits and Large Euler Subgraphs | 2013-09-17 | Paper |
| An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets | 2013-08-06 | Paper |
| Colorings with few colors: counting, enumeration and combinatorial bounds | 2013-08-01 | Paper |
| Cliques and Clubs | 2013-06-07 | Paper |
| List Coloring in the Absence of Two Subgraphs | 2013-06-07 | Paper |
| Obtaining planarity by contracting few edges | 2013-04-17 | Paper |
| Spanners of bounded degree graphs | 2013-04-04 | Paper |
| Closing Complexity Gaps for Coloring Problems on H-Free Graphs | 2013-03-21 | Paper |
| Detecting Induced Minors in AT-Free Graphs | 2013-03-21 | Paper |
| Choosability on \(H\)-free graphs | 2013-03-20 | Paper |
| Three complexity results on coloring \(P_k\)-free graphs | 2013-01-24 | Paper |
| An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs | 2013-01-07 | Paper |
| Cops and robber game without recharging | 2012-12-06 | Paper |
| 4-coloring \(H\)-free graphs when \(H\) is small | 2012-11-22 | Paper |
| Parameterized complexity of the spanning tree congestion problem | 2012-11-21 | Paper |
| Solutions for the Stable Roommates Problem with Payments | 2012-11-06 | Paper |
| How to Eliminate a Graph | 2012-11-06 | Paper |
| Minimizing Rosenthal Potential in Multicast Games | 2012-11-01 | Paper |
| Paths of bounded length and their cuts: parameterized complexity and algorithms | 2012-10-16 | Paper |
| Finding vertex-surjective graph homomorphisms | 2012-10-15 | Paper |
| Computing vertex-surjective homomorphisms to partially reflexive trees | 2012-10-11 | Paper |
| Coloring Graphs Characterized by a Forbidden Subgraph | 2012-09-25 | Paper |
| Obtaining Planarity by Contracting Few Edges | 2012-09-25 | Paper |
| Induced Disjoint Paths in Claw-Free Graphs | 2012-09-25 | Paper |
| On the parameterized complexity of coloring graphs in the absence of a linear forest | 2012-09-13 | Paper |
| Cops and Robber with Constraints | 2012-09-12 | Paper |
| Finding Vertex-Surjective Graph Homomorphisms | 2012-09-10 | Paper |
| Parameterized Complexity of Connected Even/Odd Subgraph Problems | 2012-08-23 | Paper |
| Induced disjoint paths in AT-free graphs | 2012-08-14 | Paper |
| k-Gap Interval Graphs | 2012-06-29 | Paper |
| Increasing the Minimum Degree of a Graph by Contractions | 2012-06-15 | Paper |
| Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width | 2012-06-15 | Paper |
| 4-Coloring H-Free Graphs When H Is Small | 2012-06-15 | Paper |
| Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time | 2012-05-14 | Paper |
| Edge search number of cographs | 2012-05-11 | Paper |
| Distance three labelings of trees | 2012-05-11 | Paper |
| Parameterized complexity of generalized domination problems | 2012-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389998 | 2012-04-24 | Paper |
| Containment relations in split graphs | 2012-03-19 | Paper |
| Parameterized algorithm for eternal vertex cover | 2012-03-19 | Paper |
| Approximating Width Parameters of Hypergraphs with Excluded Minors | 2012-03-15 | Paper |
| Updating the complexity status of coloring graphs without a fixed induced linear forest | 2012-03-13 | Paper |
| Induced packing of odd cycles in planar graphs | 2012-03-13 | Paper |
| Spanners in sparse graphs | 2012-01-11 | Paper |
| Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths | 2011-12-16 | Paper |
| List Coloring in the Absence of a Linear Forest | 2011-12-16 | Paper |
| How to guard a graph? | 2011-12-14 | Paper |
| Guard games on graphs: keep the intruder out! | 2011-12-07 | Paper |
| Bandwidth on AT-free graphs | 2011-12-07 | Paper |
| Branch and recharge: exact algorithms for generalized domination | 2011-09-20 | Paper |
| Coloring Graphs without Short Cycles and Long Induced Paths | 2011-08-19 | Paper |
| Contracting a Chordal Graph to a Split Graph or a Tree | 2011-08-17 | Paper |
| Contraction obstructions for treewidth | 2011-08-10 | Paper |
| Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees | 2011-06-17 | Paper |
| Parameterized complexity of coloring problems: treewidth versus vertex cover | 2011-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3082904 | 2011-03-18 | Paper |
| Approximation of minimum weight spanners for sparse graphs | 2011-02-21 | Paper |
| Approximation Algorithms for Domination Search | 2011-02-15 | Paper |
| On Coloring Graphs without Induced Forests | 2010-12-09 | Paper |
| Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds | 2010-11-16 | Paper |
| Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs | 2010-11-16 | Paper |
| Intractability of Clique-Width Parameterizations | 2010-11-04 | Paper |
| Sort and Search: exact algorithms for generalized domination | 2010-08-20 | Paper |
| Cops and Robber Game without Recharging | 2010-06-22 | Paper |
| L(2,1,1)-Labeling Is NP-Complete for Trees | 2010-06-17 | Paper |
| Complexity of the packing coloring problem for trees | 2010-05-25 | Paper |
| Guard Games on Graphs: Keep the Intruder Out! | 2010-05-11 | Paper |
| Pursuing a fast robber on a graph | 2010-03-09 | Paper |
| Parameterized Complexity of Generalized Domination Problems | 2010-01-21 | Paper |
| Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms | 2010-01-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Induced Packing of Odd Cycles in a Planar Graph | 2009-12-17 | Paper |
| Bandwidth on AT-Free Graphs | 2009-12-17 | Paper |
| The capture time of a graph | 2009-12-15 | Paper |
| Three Complexity Results on Coloring P k -Free Graphs | 2009-12-11 | Paper |
| Contraction Bidimensionality: The Accurate Picture | 2009-10-29 | Paper |
| Choosability of P 5-Free Graphs | 2009-10-16 | Paper |
| Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover | 2009-06-03 | Paper |
| Branch and Recharge: Exact Algorithms for Generalized Domination | 2009-02-17 | Paper |
| A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs | 2009-02-03 | Paper |
| How to Guard a Graph? | 2009-01-29 | Paper |
| Complexity of the Packing Coloring Problem for Trees | 2009-01-20 | Paper |
| Parameterized Complexity for Domination Problems on Degenerate Graphs | 2009-01-20 | Paper |
| Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) | 2008-08-28 | Paper |
| Spanners in Sparse Graphs | 2008-08-28 | Paper |
| Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs | 2008-07-01 | Paper |
| Distance Constrained Labelings of Trees | 2008-05-27 | Paper |
| Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5754055 | 2007-08-21 | Paper |
| Backbone colorings for graphs: Tree and path backbones | 2007-06-11 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Systems of pairs of \(q\)-distant representatives, and graph colorings | 2006-01-03 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| On a complementary interval graph with the lowest max-degree | 2004-02-09 | Paper |
| Interval degree and bandwidth of a graph | 2003-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4793752 | 2003-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4793772 | 2003-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2782692 | 2002-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2736128 | 2001-08-28 | Paper |
| The total vertex separation number and profile of a graph | 2001-08-02 | Paper |
| Graph Searching and Interval Completion | 2001-03-19 | Paper |
| The total vertex separation number of a graph | 2001-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387119 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232802 | 1999-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4396114 | 1998-06-11 | Paper |
| The \(k\)-search number of graphs of regular polyhedra | 1998-01-14 | Paper |
| Some generalizations of the problem on the search number of a graph | 1997-11-20 | Paper |
| Minimal trees of a given search number | 1997-01-14 | Paper |
| Computing the isoperimetric number of a graph | 1996-02-08 | Paper |
| The cutwidth and the vertex separation number of hypergraphs and their König’s representations | 1996-01-15 | Paper |
| The cutwidth of a graph and the vertex separation number of the line graph | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4029792 | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3351169 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5749330 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3199182 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3483321 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484665 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3489816 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818815 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4204018 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3829586 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4722115 | 1986-01-01 | Paper |
