| Publication | Date of Publication | Type |
|---|
| Generalized edge-rankings of trees (extended abstract) | 2024-06-05 | Paper |
| Rectangular grid drawings of plane graphs | 2024-01-29 | Paper |
| Simple reduction of f-colorings to edge-colorings | 2023-12-12 | Paper |
| Finding a shortest pair of paths on the plane with obstacles and crossing areas | 2023-03-21 | Paper |
| Algorithms for finding f-colorings of partial k-trees | 2023-03-21 | Paper |
| Finding edge-disjoint paths in partial k-trees | 2023-01-25 | Paper |
| A parallel algorithm for edge-coloring partial k-trees | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635978 | 2018-04-23 | Paper |
| A linear-time algorithm for four-partitioning four-connected planar graphs | 2016-05-26 | Paper |
| Generalized edge-colorings of weighted graphs | 2016-04-12 | Paper |
| Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs | 2015-12-08 | Paper |
| Parametric power supply networks | 2015-07-10 | Paper |
| A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES | 2015-04-29 | Paper |
| A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS | 2015-04-29 | Paper |
| Edge-Colorings of Weighted Graphs | 2015-02-27 | Paper |
| Spanning Distribution Forests of Graphs | 2014-09-02 | Paper |
| Approximation Algorithms for Bandwidth Consecutive Multicolorings | 2014-09-02 | Paper |
| Bandwidth consecutive multicolorings of graphs | 2014-04-15 | Paper |
| Spanning Distribution Trees of Graphs | 2014-04-03 | Paper |
| Parametric Power Supply Networks | 2013-06-11 | Paper |
| Minimum cost partitions of trees with supply and demand | 2013-01-28 | Paper |
| ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH | 2013-01-24 | Paper |
| Small grid drawings of planar graphs with balanced partition | 2012-12-21 | Paper |
| Algorithms for Bandwidth Consecutive Multicolorings of Graphs | 2012-07-16 | Paper |
| Partitioning a weighted tree into subtrees with weights in a given range | 2012-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389286 | 2012-04-26 | Paper |
| Energy and depth of threshold circuits | 2012-04-03 | Paper |
| List Total Colorings of Series-Parallel Graphs | 2011-03-18 | Paper |
| Size-energy tradeoffs for unate circuits computing symmetric Boolean functions | 2011-02-21 | Paper |
| CONVEX DRAWINGS OF INTERNALLY TRICONNECTED PLANE GRAPHS ON O(n2) GRIDS | 2010-12-15 | Paper |
| Minimum Cost Partitions of Trees with Supply and Demand | 2010-12-09 | Paper |
| Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings | 2010-09-07 | Paper |
| Partitioning graphs of supply and demand | 2010-04-28 | Paper |
| Small Grid Drawings of Planar Graphs with Balanced Bipartition | 2010-02-09 | Paper |
| Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids | 2009-12-17 | Paper |
| Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends | 2009-11-27 | Paper |
| Energy Complexity and Depth of Threshold Circuits | 2009-10-20 | Paper |
| Size and Energy of Threshold Circuits Computing Mod Functions | 2009-10-16 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions | 2009-06-03 | Paper |
| Open rectangle-of-influence drawings of inner triangulated plane graphs | 2009-05-06 | Paper |
| Approximability of partitioning graphs with supply and demand | 2009-02-23 | Paper |
| Octagonal drawings of plane graphs with prescribed face areas | 2009-02-12 | Paper |
| Partitioning a Weighted Tree to Subtrees of Almost Uniform Size | 2009-01-29 | Paper |
| Convex Grid Drawings of Plane Graphs with Rectangular Contours | 2009-01-19 | Paper |
| Efficient Compression of Web Graphs | 2008-07-10 | Paper |
| Approximability of Partitioning Graphs with Supply and Demand | 2008-04-24 | Paper |
| Convex Grid Drawings of Plane Graphs with Rectangular Contours | 2008-04-24 | Paper |
| A revised transformation protocol for unconditionally secure secret key exchange | 2008-04-03 | Paper |
| Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size | 2008-01-11 | Paper |
| Total colorings of degenerate graphs | 2007-11-12 | Paper |
| Algorithms for finding distance-edge-colorings of graphs | 2007-10-30 | Paper |
| Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size | 2007-09-10 | Paper |
| Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs | 2007-08-28 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS | 2006-10-16 | Paper |
| CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES | 2006-10-16 | Paper |
| INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS | 2006-05-29 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| PARTITIONING TREES OF SUPPLY AND DEMAND | 2005-08-03 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Orthogonal Drawings of Plane Graphs Without Bends | 2005-05-25 | Paper |
| CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS | 2005-05-06 | Paper |
| List total colorings of series-parallel graphs | 2005-05-04 | Paper |
| Algorithm for the cost edge-coloring of trees | 2005-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154374 | 2004-12-16 | Paper |
| Multicolorings of series-parallel graphs | 2004-12-02 | Paper |
| Rectangular drawings of planar graphs | 2004-10-04 | Paper |
| LABELING POINTS WITH RECTANGLES OF VARIOUS SHAPES | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808664 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043744 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472295 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472489 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472498 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474089 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474118 | 2004-08-04 | Paper |
| A linear algorithm for compact box-drawings of trees | 2003-10-29 | Paper |
| Characterization of optimal key set protocols | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427881 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422281 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422283 | 2003-09-03 | Paper |
| Finding a region with the minimum total \(L_1\) distance from prescribed terminals | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414512 | 2003-07-25 | Paper |
| Finding a noncrossing Steiner forest in plane graphs under a 2-face condition | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536431 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551367 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548301 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766817 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535043 | 2002-06-12 | Paper |
| Rectangular drawings of plane graphs without designated corners | 2002-05-20 | Paper |
| The edge-disjoint paths problem is NP-complete for series-parallel graphs | 2002-04-22 | Paper |
| Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings | 2002-03-14 | Paper |
| Grid drawings of 4-connected plane graphs | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707230 | 2002-01-01 | Paper |
| A linear algorithm for finding \([g,f\)-colorings of partial \(k\)-trees] | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511236 | 2001-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761869 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511238 | 2001-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501699 | 2001-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525701 | 2001-01-24 | Paper |
| Box-Rectangular Drawings of Plane Graphs | 2000-12-19 | Paper |
| A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249537 | 2000-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234159 | 2000-10-10 | Paper |
| A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs | 2000-09-19 | Paper |
| Algorithms for generalized vertex-rankings of partial k-trees | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250775 | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234138 | 1999-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232781 | 1999-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246735 | 1999-06-15 | Paper |
| Edge-Coloring and f-Coloring for Various Classes of Graphs | 1999-05-18 | Paper |
| Edge-Coloring Problems for Graphs. | 1999-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232798 | 1999-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218438 | 1999-02-14 | Paper |
| Rectangular grid drawings of plane graphs | 1998-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364591 | 1998-02-23 | Paper |
| Shortest Non-Crossing Rectilinear Paths in Plane Regions | 1998-02-02 | Paper |
| An NC Parallel Algorithm for Edge-Coloring Series–Parallel Multigraphs | 1997-11-10 | Paper |
| Edge-Coloring Partialk-Trees | 1996-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886041 | 1996-09-23 | Paper |
| A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs | 1996-02-20 | Paper |
| EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING | 1995-03-01 | Paper |
| \(k\)-connectivity and decomposition of graphs into forests | 1995-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138923 | 1994-09-20 | Paper |
| SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS | 1994-04-27 | Paper |
| Planar graphs: Theory and algorithms | 1993-06-05 | Paper |
| Multiple assignment scheme for sharing secret | 1993-05-16 | Paper |
| Algorithms for routing around a rectangle | 1993-05-16 | Paper |
| Variable-priority queue and doughnut routing | 1993-01-12 | Paper |
| A linear algorithm for bipartition of biconnected graphs | 1990-01-01 | Paper |
| Edge-disjoint paths in a grid bounded by two nested rectangles | 1990-01-01 | Paper |
| On the fg-coloring of graphs | 1990-01-01 | Paper |
| On the $1.1$ Edge-Coloring of Multigraphs | 1990-01-01 | Paper |
| Improved edge-coloring algorithms for planar graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5753968 | 1990-01-01 | Paper |
| Algorithms for multicommodity flows in planar graphs | 1989-01-01 | Paper |
| The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs | 1989-01-01 | Paper |
| On the f-coloring of multigraphs | 1988-01-01 | Paper |
| Planar Multicommodity Fows, Maximum Matchings and Negative Cycles | 1986-01-01 | Paper |
| A better than “best possible” algorithm to edge color multigraphs | 1986-01-01 | Paper |
| A theorem on paths in planar graphs | 1986-01-01 | Paper |
| Drawing plane graphs nicely | 1985-01-01 | Paper |
| A linear algorithm for embedding planar graphs using PQ-trees | 1985-01-01 | Paper |
| Arboricity and Subgraph Listing Algorithms | 1985-01-01 | Paper |
| An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3693539 | 1985-01-01 | Paper |
| Lower bounds for combinatorial problems on graphs | 1985-01-01 | Paper |
| A note on the critical problem for matroids | 1984-01-01 | Paper |
| A note on nongraphic matroids | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220608 | 1984-01-01 | Paper |
| An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs | 1983-01-01 | Paper |
| An algorithm for finding a large independent set in planar graphs | 1983-01-01 | Paper |
| Linear-time computability of combinatorial problems on series-parallel graphs | 1982-01-01 | Paper |
| An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs | 1982-01-01 | Paper |
| Combinatorial problems on series-parallel graphs | 1981-01-01 | Paper |
| On the maximum matchings of regular multigraphs | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916605 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3917502 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933762 | 1981-01-01 | Paper |
| A linear 5-coloring algorithm of planar graphs | 1981-01-01 | Paper |
| A 1-tough nonhamiltonian maximal planar graph | 1980-01-01 | Paper |
| An upper bound on the length of a Hamiltonian walk of a maximal planar graph | 1980-01-01 | Paper |
| An algorithm for finding a short closed spanning walk in a graph | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3888543 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3888545 | 1980-01-01 | Paper |
| On the relationship between the genus and the cardinality of the maximum matchings of a graph | 1979-01-01 | Paper |
| Lower bounds on the cardinality of the maximum matchings of planar graphs | 1979-01-01 | Paper |
| Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4200077 | 1978-01-01 | Paper |
