| Publication | Date of Publication | Type |
|---|
| On Interval Routing Schemes and treewidth | 2024-02-28 | Paper |
| NC-algorithms for graphs with small treewidth | 2024-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192477 | 2024-02-12 | Paper |
| Reduction algorithms for constructing solutions in graphs with small treewidth | 2024-01-29 | Paper |
| Dynamic algorithms for graphs with treewidth 2 | 2024-01-05 | Paper |
| Domino treewidth | 2024-01-05 | Paper |
| Rankings of graphs | 2024-01-05 | Paper |
| On reduction algorithms for graphs with small treewidth | 2024-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6068238 | 2023-11-13 | Paper |
| An ETH-Tight Exact Algorithm for Euclidean TSP | 2023-06-09 | Paper |
| Problems hard for treewidth but easy for stable gonality | 2023-05-05 | Paper |
| Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem | 2023-05-02 | Paper |
| Typical sequences revisited -- computing width parameters of graphs | 2023-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874334 | 2023-02-07 | Paper |
| Treewidth is NP-Complete on Cubic Graphs (and related results) | 2023-01-24 | Paper |
| Knot diagrams of treewidth two | 2022-12-21 | Paper |
| The pathwidth and treewidth of cographs | 2022-12-09 | Paper |
| Triangulating planar graphs while minimizing the maximum degree | 2022-12-09 | Paper |
| Testing superperfection of k-trees | 2022-12-09 | Paper |
| Constructing tree decompositions of graphs with bounded gonality | 2022-10-18 | Paper |
| Steiner trees for hereditary graph classes | 2022-10-13 | Paper |
| A simple linear time algorithm for triangulating three-colored graphs | 2022-08-18 | Paper |
| Distributed computing on transitive networks: The torus | 2022-08-16 | Paper |
| Dynamic sampling from a discrete probability distribution with a known distribution of rates | 2022-07-15 | Paper |
| From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability | 2022-07-13 | Paper |
| Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} | 2022-06-08 | Paper |
| Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes | 2021-10-04 | Paper |
| Parameterized Complexity of Conflict-Free Graph Coloring | 2021-09-17 | Paper |
| Stable divisorial gonality is in NP | 2021-06-24 | Paper |
| Constructing tree decompositions of graphs with bounded gonality | 2021-04-21 | Paper |
| Steiner trees for hereditary graph classes: a treewidth perspective | 2021-04-15 | Paper |
| A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs | 2021-01-13 | Paper |
| Subgraph isomorphism on graph classes that exclude a substructure | 2020-11-11 | Paper |
| Stable divisorial gonality is in NP | 2020-10-22 | Paper |
| On the exact complexity of polyomino packing | 2020-09-03 | Paper |
| On the Exact Complexity of Polyomino Packing | 2020-08-11 | Paper |
| Computing treewidth on the GPU | 2020-05-27 | Paper |
| Constructing Tree Decompositions of Graphs with Bounded Gonality | 2020-05-12 | Paper |
| Recognizing hyperelliptic graphs in polynomial time | 2020-04-06 | Paper |
| Subgraph isomorphism on graph classes that exclude a substructure | 2020-02-06 | Paper |
| Parameterized complexity of conflict-free graph coloring | 2020-01-16 | Paper |
| Two strikes against perfect phylogeny | 2019-12-04 | Paper |
| On the maximum weight minimal separator | 2019-11-13 | Paper |
| A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs | 2019-08-22 | Paper |
| The homogeneous broadcast problem in narrow and wide strips. I: Algorithms | 2019-05-21 | Paper |
| The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds | 2019-05-21 | Paper |
| Typical Sequences Revisited --- Computing Width Parameters of Graphs | 2019-05-09 | Paper |
| Treewidth and pathwidth of permutation graphs | 2019-03-29 | Paper |
| Intervalizing k-colored graphs | 2019-01-10 | Paper |
| Parallel algorithms with optimal speedup for bounded treewidth | 2019-01-10 | Paper |
| On exploring always-connected temporal graphs of small pathwidth | 2018-12-05 | Paper |
| Recognizing hyperelliptic graphs in polynomial time | 2018-11-22 | Paper |
| (Meta) Kernelization | 2018-08-02 | Paper |
| Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity | 2018-07-25 | Paper |
| Constructive linear time algorithms for branchwidth | 2018-07-04 | Paper |
| Degree-constrained orientation of maximum satisfaction: Graph classes and parameterized complexity | 2018-04-19 | Paper |
| A faster parameterized algorithm for pseudoforest deletion | 2018-04-10 | Paper |
| Cut and Count and representative sets on branch decompositions | 2018-04-10 | Paper |
| A faster parameterized algorithm for pseudoforest deletion | 2018-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4602259 | 2018-01-09 | Paper |
| Subexponential Time Algorithms for Embedding H-Minor Free Graphs | 2017-12-19 | Paper |
| Parallel algorithms for series parallel graphs | 2017-12-05 | Paper |
| Definability Equals Recognizability for $k$-Outerplanar Graphs | 2017-09-29 | Paper |
| Practical algorithms for linear Boolean-width | 2017-09-29 | Paper |
| The homogeneous broadcast problem in narrow and wide strips | 2017-09-22 | Paper |
| Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees | 2017-09-11 | Paper |
| Improved Lower Bounds for Graph Embedding Problems | 2017-07-21 | Paper |
| On the Maximum Weight Minimal Separator | 2017-05-19 | Paper |
| On making a distinguished vertex of minimum degree by vertex deletion | 2017-05-17 | Paper |
| Characterizing width two for variants of treewidth | 2016-11-24 | Paper |
| Recognizability equals definability for graphs of bounded treewidth and bounded chordality | 2016-10-14 | Paper |
| Beyond NP-completeness for problems of bounded width (extended abstract) | 2016-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816028 | 2016-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816059 | 2016-07-01 | Paper |
| It is hard to know when greedy is good for finding independent sets | 2016-05-26 | Paper |
| Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems | 2016-05-26 | Paper |
| A $c^k n$ 5-Approximation Algorithm for Treewidth | 2016-04-11 | Paper |
| Robust Recoverable Path Using Backup Nodes | 2016-03-10 | Paper |
| Exact algorithms for intervalizing coloured graphs | 2016-03-09 | Paper |
| Subexponential Time Algorithms for Finding Small Tree and Path Decompositions | 2015-11-19 | Paper |
| PSPACE-Completeness of Bloxorz and of Games with 2-Buttons | 2015-09-21 | Paper |
| Google Scholar makes it hard -- the complexity of organizing one's publications | 2015-09-15 | Paper |
| Lower Bounds for Kernelization | 2015-09-15 | Paper |
| Online topological ordering | 2015-09-02 | Paper |
| Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth | 2015-06-09 | Paper |
| A linear time algorithm for finding tree-decompositions of small treewidth | 2015-05-07 | Paper |
| Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions | 2015-05-04 | Paper |
| FINDING SMALL EQUIVALENT DECISION TREES IS HARD | 2015-04-29 | Paper |
| MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree $k$-Outerplanar Graphs | 2015-03-05 | Paper |
| On exact algorithms for treewidth | 2014-12-05 | Paper |
| Exact algorithms for Kayles | 2014-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921699 | 2014-10-13 | Paper |
| (Meta) Kernelization | 2014-07-25 | Paper |
| Kernelization Lower Bounds by Cross-Composition | 2014-06-19 | Paper |
| Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization | 2014-04-10 | Paper |
| Scheduling of pipelined operator graphs | 2014-02-05 | Paper |
| Kernel bounds for path and cycle problems | 2014-01-13 | Paper |
| The Fine Details of Fast Dynamic Programming over Tree Decompositions | 2013-12-10 | Paper |
| Speeding Up Dynamic Programming with Representative Sets | 2013-12-10 | Paper |
| Fixed-Parameter Tractability and Characterizations of Small Special Treewidth | 2013-12-06 | Paper |
| Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter | 2013-10-21 | Paper |
| Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth | 2013-08-06 | Paper |
| Partition into triangles on bounded degree graphs | 2013-08-01 | Paper |
| Exact algorithms for edge domination | 2013-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910758 | 2013-03-19 | Paper |
| A note on exact algorithms for vertex ordering problems on graphs | 2012-12-06 | Paper |
| Parameterized complexity of the spanning tree congestion problem | 2012-11-21 | Paper |
| Fixed-Parameter Tractability of Treewidth and Pathwidth | 2012-09-05 | Paper |
| Kernel Bounds for Structural Parameterizations of Pathwidth | 2012-08-14 | Paper |
| The Valve Location Problem in Simple Network Topologies | 2012-07-28 | Paper |
| Kernel Bounds for Path and Cycle Problems | 2012-06-15 | Paper |
| On switching classes, NLC-width, cliquewidth and treewidth | 2012-05-30 | Paper |
| Exact algorithms for dominating set | 2012-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113681 | 2012-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113682 | 2012-01-23 | Paper |
| Exact Algorithms for Kayles | 2011-12-16 | Paper |
| Faster parameterized algorithms for \textsc{Minimum Fill-in} | 2011-12-14 | Paper |
| Quadratic kernelization for convex recoloring of trees | 2011-09-20 | Paper |
| Kernel bounds for disjoint cycles and disjoint paths | 2011-09-12 | Paper |
| Treewidth computations. II. Lower bounds | 2011-07-18 | Paper |
| Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization | 2011-07-06 | Paper |
| On Stopping Evidence Gathering for Diagnostic Bayesian Networks | 2011-06-29 | Paper |
| Spanning tree congestion of \(k\)-outerplanar graphs | 2011-05-16 | Paper |
| Exact Algorithms for Intervalizing Colored Graphs | 2011-05-12 | Paper |
| The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks | 2011-05-11 | Paper |
| The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks | 2011-02-15 | Paper |
| A Local Search Algorithm for Branchwidth | 2011-02-15 | Paper |
| Partition into Triangles on Bounded Degree Graphs | 2011-02-15 | Paper |
| Complexity Results for the Spanning Tree Congestion Problem | 2010-11-16 | Paper |
| Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions | 2010-09-27 | Paper |
| Faster Algorithms on Branch and Clique Decompositions | 2010-09-03 | Paper |
| A cubic kernel for feedback vertex set and loop cutset | 2010-05-05 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Treewidth computations. I: Upper bounds | 2010-04-14 | Paper |
| Clustering with partial information | 2010-03-09 | Paper |
| A Kernel for Convex Recoloring of Weighted Forests | 2010-01-28 | Paper |
| Kernelization: New Upper and Lower Bound Techniques | 2010-01-14 | Paper |
| Planar Capacitated Dominating Set Is W[1-Hard] | 2010-01-14 | Paper |
| On problems without polynomial kernels | 2009-11-10 | Paper |
| Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution | 2009-10-29 | Paper |
| Kernel Bounds for Disjoint Cycles and Disjoint Paths | 2009-10-29 | Paper |
| On the minimum corridor connection problem and other generalized geometric problems | 2009-08-14 | Paper |
| Wooden geometric puzzles: Design and hardness proofs | 2009-08-06 | Paper |
| Derivation of algorithms for cutwidth and related graph layout parameters | 2009-04-30 | Paper |
| Quadratic Kernelization for Convex Recoloring of Trees | 2009-03-06 | Paper |
| Clustering with Partial Information | 2009-02-03 | Paper |
| Faster Parameterized Algorithms for Minimum Fill-In | 2009-01-29 | Paper |
| A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs | 2009-01-29 | Paper |
| The Valve Location Problem in Simple Network Topologies | 2009-01-20 | Paper |
| Contraction and Treewidth Lower Bounds | 2009-01-19 | Paper |
| Local Monotonicity in Probabilistic Networks | 2008-09-16 | Paper |
| Treewidth: Characterizations, Applications, and Computations | 2008-09-04 | Paper |
| On Problems without Polynomial Kernels (Extended Abstract) | 2008-08-28 | Paper |
| Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint | 2008-07-15 | Paper |
| A Linear Kernel for Planar Feedback Vertex Set | 2008-06-05 | Paper |
| Exact Algorithms for Edge Domination | 2008-06-05 | Paper |
| Weighted Treewidth Algorithmic Techniques and Results | 2008-05-27 | Paper |
| Treewidth lower bounds with brambles | 2008-05-27 | Paper |
| On Exact Algorithms for Treewidth | 2008-03-11 | Paper |
| On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems | 2008-02-21 | Paper |
| A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth | 2008-01-04 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Algorithms for graphs embeddable with few crossings per edge | 2007-11-28 | Paper |
| Treewidth: Structure and Algorithms | 2007-11-15 | Paper |
| Wooden Geometric Puzzles: Design and Hardness Proofs | 2007-11-15 | Paper |
| A Cubic Kernel for Feedback Vertex Set | 2007-09-03 | Paper |
| On the maximum cardinality search lower bound for treewidth | 2007-07-19 | Paper |
| Safe reduction rules for weighted treewidth | 2007-03-12 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Safe separators for treewidth | 2006-03-29 | Paper |
| On algorithms for (\(P_5\), gem)-free graphs | 2006-03-20 | Paper |
| Equitable colorings of bounded treewidth graphs | 2006-03-20 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Cutwidth I: A linear time fixed parameter algorithm | 2005-08-01 | Paper |
| Cutwidth II: Algorithms for partial w-trees of bounded degree | 2005-08-01 | Paper |
| SIZES OF ORDERED DECISION TREES | 2005-06-22 | Paper |
| A Note on Rectilinearity and Angular Resolution | 2005-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4661878 | 2005-03-30 | Paper |
| Radio Labeling with Preassigned Frequencies | 2005-02-23 | Paper |
| Tree decompositions with small cost | 2005-02-22 | Paper |
| Tree Decompositions with Small Cost | 2004-08-12 | Paper |
| Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472491 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474121 | 2004-08-04 | Paper |
| Approximations for -Colorings of Graphs | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448756 | 2004-02-18 | Paper |
| Necessary edges in \(k\)-chordalisations of graphs | 2004-01-06 | Paper |
| Finding a \(\Delta\)-regular supergraph of minimum order | 2003-09-25 | Paper |
| Computing the treewidth and the minimum fill-in with the modular decomposition | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414495 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411360 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796189 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329175 | 2003-01-30 | Paper |
| Reduction algorithms for graphs of small treewidth | 2003-01-14 | Paper |
| Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs | 2002-12-01 | Paper |
| Kayles and Nimbers | 2002-09-30 | Paper |
| Approximation of pathwidth of outerplanar graphs | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501549 | 2002-04-08 | Paper |
| Parallel algorithms for series parallel graphs and graphs with treewidth two | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741323 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721971 | 2001-07-11 | Paper |
| Graphs with Branchwidth at Most Three | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500843 | 2000-08-27 | Paper |
| The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934329 | 2000-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699283 | 2000-08-03 | Paper |
| Improved self-reduction algorithms for graphs with bounded treewidth | 2000-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942616 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703656 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836521 | 1999-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260373 | 1999-09-19 | Paper |
| Isomorphism for graphs of bounded distance width | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250226 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246749 | 1999-06-15 | Paper |
| A partial k-arboretum of graphs with bounded treewidth | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218147 | 1998-11-11 | Paper |
| Treewidth and Minimum Fill-in on d-Trapezoid Graphs | 1998-10-28 | Paper |
| Parallel Algorithms with Optimal Speedup for Bounded Treewidth | 1998-09-21 | Paper |
| On interval routing schemes and treewidth | 1998-06-15 | Paper |
| Rankings of Graphs | 1998-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373678 | 1998-02-16 | Paper |
| Treewidth for graphs with small chordality | 1998-01-07 | Paper |
| The parameterized complexity of sequence alignment and consensus | 1997-09-29 | Paper |
| Domino Treewidth | 1997-08-25 | Paper |
| Triangulating planar graphs while minimizing the maximum degree | 1997-08-11 | Paper |
| A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth | 1997-06-09 | Paper |
| Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs | 1997-05-11 | Paper |
| On intervalizing \(k\)-colored graphs for DNA physical mapping | 1997-04-21 | Paper |
| Restrictions of graph partition problems. I | 1997-02-28 | Paper |
| \(W[2\)-hardness of precedence constrained \(K\)-processor scheduling] | 1996-08-01 | Paper |
| Treewidth and Pathwidth of Permutation Graphs | 1996-02-20 | Paper |
| Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree | 1995-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4322074 | 1995-03-20 | Paper |
| Scheduling with incompatible jobs | 1995-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4291429 | 1995-01-12 | Paper |
| ON DISJOINT CYCLES | 1995-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281629 | 1994-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281635 | 1994-03-10 | Paper |
| The distributed bit complexity of the ring: From the anonymous to the non-anonymous case | 1994-02-22 | Paper |
| A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs | 1993-12-09 | Paper |
| Complexity of path-forming games | 1993-08-30 | Paper |
| The Pathwidth and Treewidth of Cographs | 1993-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694737 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694755 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694712 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036592 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037427 | 1993-05-18 | Paper |
| On Linear Time Minor Tests with Depth-First Search | 1993-05-16 | Paper |
| The complexity of coloring games on perfect graphs | 1993-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028100 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028920 | 1993-03-28 | Paper |
| ON THE COMPLEXITY OF SOME COLORING GAMES | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974855 | 1992-06-26 | Paper |
| New lower bound techniques for distributed leader finding and other problems on rings of processors | 1991-01-01 | Paper |
| Some lower bound results for decentralized extrema-finding in rings of processors | 1991-01-01 | Paper |
| Computational complexity of norm-maximization | 1990-01-01 | Paper |
| Bit-optimal election in synchronous rings | 1990-01-01 | Paper |
| The complexity of finding uniform emulations on paths and ring networks | 1990-01-01 | Paper |
| Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees | 1990-01-01 | Paper |
| Achromatic number is NP-complete for cographs and interval graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4734761 | 1988-01-01 | Paper |
| A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors | 1988-01-01 | Paper |
| The complexity of finding uniform emulations on fixed graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795218 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796771 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758865 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3769937 | 1987-01-01 | Paper |
| Diameter increase caused by edge deletion | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742712 | 1986-01-01 | Paper |
| Simulation of large networks on smaller networks | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3681950 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3693533 | 1984-01-01 | Paper |
