| Publication | Date of Publication | Type |
|---|
| A Gray code of ordered trees | 2024-11-12 | Paper |
| Variants of Euclidean \(k\)-center clusterings | 2024-08-22 | Paper |
| \((t, s)\)-completely independent spanning trees | 2024-07-19 | Paper |
| One-dimensional \(r\)-gathering under uncertainty | 2024-02-23 | Paper |
| Rectangular grid drawings of plane graphs | 2024-01-29 | Paper |
| Enumerating floorplans with walls | 2024-01-24 | Paper |
| Away from each other | 2023-11-24 | Paper |
| Family Trees for Enumeration | 2023-11-16 | Paper |
| Escape from the room | 2023-08-10 | Paper |
| The Coverage Problem by Aligned Disks | 2023-07-21 | Paper |
| The coverage problem by aligned disks | 2023-03-30 | Paper |
| Floorplans with walls | 2022-12-22 | Paper |
| A parallel algorithm for edge-coloring partial k-trees | 2022-12-09 | Paper |
| Max-min dispersion on a line | 2022-10-04 | Paper |
| r-Gatherings on a star and uncertain r-gatherings on a line | 2022-09-02 | Paper |
| An application of the arithmetic of elliptic curves to the class number problem for quadratic fields | 2021-09-13 | Paper |
| Exact algorithms for the max-min dispersion problem | 2020-07-07 | Paper |
| Max-Min 3-Dispersion problems | 2020-02-24 | Paper |
| A Simple Algorithm for $r$-gatherings on the Line | 2019-10-25 | Paper |
| \(r\)-gatherings on a star | 2019-10-15 | Paper |
| Max-min dispersion on a line | 2019-10-11 | Paper |
| Sequentially Swapping Colored Tokens on Graphs | 2019-02-14 | Paper |
| More routes for evacuation | 2018-10-04 | Paper |
| A simple algorithm for r-gatherings on the line | 2018-06-15 | Paper |
| Floorplans with columns | 2018-02-26 | Paper |
| Sequentially Swapping Colored Tokens on Graphs | 2017-05-05 | Paper |
| Assigning Proximity Facilities for Gatherings | 2016-09-02 | Paper |
| On the class number divisibility of pairs of quadratic fields obtained from points on elliptic curves | 2016-06-23 | Paper |
| Efficient algorithms for a simple network design problem | 2016-06-10 | Paper |
| A linear-time algorithm for four-partitioning four-connected planar graphs | 2016-05-26 | Paper |
| A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares | 2016-01-18 | Paper |
| On r-Gatherings on the Line | 2015-11-12 | Paper |
| Enumeration, Counting, and Random Generation of Ladder Lotteries | 2015-11-12 | Paper |
| A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS | 2015-04-29 | Paper |
| A 4.31-approximation for the geometric unique coverage problem on unit disks | 2014-07-07 | Paper |
| Generating all triangulations of plane graphs | 2013-11-28 | Paper |
| Bounding the number of reduced trees, cographs, and series-parallel graphs by compression | 2013-09-05 | Paper |
| A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks | 2013-03-21 | Paper |
| A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares | 2012-08-14 | Paper |
| Efficient enumeration of ordered trees with \(k\) leaves | 2012-08-08 | Paper |
| Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression | 2012-06-08 | Paper |
| A compact encoding of plane triangulations with efficient query supports | 2012-03-27 | Paper |
| A Compact Encoding of Unordered Binary Trees | 2011-07-01 | Paper |
| How to Obtain the Complete List of Caterpillars | 2011-03-18 | Paper |
| Efficient enumeration of all ladder lotteries and its application | 2010-04-15 | Paper |
| A family of quintic cyclic fields with even class number parameterized by rational points on an elliptic curve | 2009-11-04 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Listing All Plane Graphs | 2009-05-19 | Paper |
| Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) | 2009-02-24 | Paper |
| Generating All Triangulations of Plane Graphs (Extended Abstract) | 2009-02-24 | Paper |
| A Compact Encoding of Plane Triangulations with Efficient Query Supports | 2008-03-25 | Paper |
| Listing All Plane Graphs | 2008-03-25 | Paper |
| A Compact Encoding of Rectangular Drawings with Efficient Query Supports | 2008-01-04 | Paper |
| A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs | 2007-11-13 | Paper |
| Efficient Algorithms for Airline Problem | 2007-11-13 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS | 2006-10-16 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| LABELING POINTS WITH RECTANGLES OF VARIOUS SHAPES | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472295 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474080 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472319 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472498 | 2004-08-04 | Paper |
| Efficient generation of triconnected plane triangulations. | 2004-03-14 | Paper |
| Enumerating Floorplans with Some Properties | 2003-06-26 | Paper |
| Efficient generation of plane trees. | 2003-01-21 | Paper |
| A note on the construction of metacyclic extensions | 2002-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551355 | 2002-09-05 | Paper |
| On the Galois module structure of ideal class groups | 2002-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766691 | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766817 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535037 | 2002-06-12 | Paper |
| Rectangular drawings of plane graphs without designated corners | 2002-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331294 | 2002-05-15 | Paper |
| Grid drawings of 4-connected plane graphs | 2002-01-21 | Paper |
| On generic cyclic polynomials of odd prime degree | 2001-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761870 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501699 | 2001-01-29 | Paper |
| Box-Rectangular Drawings of Plane Graphs | 2000-12-19 | 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 |
| Edge-Coloring Problems for Graphs. | 1999-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232798 | 1999-03-15 | Paper |
| Minimum-width grid drawings of plane graphs | 1999-01-11 | Paper |
| Rectangular grid drawings of plane graphs | 1998-11-19 | Paper |
| Edge-Coloring Partialk-Trees | 1996-12-08 | Paper |
| SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS | 1994-04-27 | Paper |
| The 2-class groups of cubic fields and 2-descents on elliptic curves | 1993-06-17 | Paper |
| On the fg-coloring of graphs | 1990-01-01 | Paper |
| On the f-coloring of multigraphs | 1988-01-01 | Paper |
| Construction of pure cubic fields with large 2-class groups | 1988-01-01 | Paper |
| Ideal class groups of cubic cyclic fields | 1986-01-01 | Paper |
| On the construction of pure number fields of odd degrees with large 2-class groups | 1986-01-01 | Paper |
| On ideal groups of algebraic number fields. | 1985-01-01 | Paper |
| On the 2-rank of the ideal class groups of pure number fields | 1984-01-01 | Paper |
| On ideal class groups of algebraic number fields | 1984-01-01 | Paper |
| On the construction of certain number fields | 1983-01-01 | Paper |
| Class numbers of pure cubic fields | 1983-01-01 | Paper |
