| Publication | Date of Publication | Type |
|---|
| Area-efficient algorithms for upward straight-line tree drawings | 2024-01-29 | Paper |
| The geodesic farthest-site Voronoi diagram in a polygonal domain with holes | 2017-10-20 | Paper |
| Tight analysis of a self-approaching strategy for the online kernel-search problem | 2016-06-16 | Paper |
| Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems | 2016-06-13 | Paper |
| Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs | 2015-09-23 | Paper |
| Paired many-to-many disjoint path covers in faulty hypercubes | 2014-01-13 | Paper |
| Farthest Voronoi Diagrams under Travel Time Metrics | 2012-06-08 | Paper |
| The balloon popping problem revisited: lower and upper bounds | 2011-11-23 | Paper |
| Scheduling Broadcasts with Deadlines | 2011-03-18 | Paper |
| A 6.55 factor primal-dual approximation algorithm for the connected facility location problem | 2009-12-02 | Paper |
| The Balloon Popping Problem Revisited: Lower and Upper Bounds | 2009-12-01 | Paper |
| Computing minimum-area rectilinear convex hull and \(L\)-shape | 2009-08-14 | Paper |
| Hamiltonian properties on the class of hypercube-like networks | 2009-07-21 | Paper |
| Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs | 2009-07-14 | Paper |
| Labeling points with given rectangles | 2009-07-09 | Paper |
| OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM | 2009-06-30 | Paper |
| Casting an object with a core | 2009-06-16 | Paper |
| Approximation algorithms for connected facility location problems | 2009-05-04 | Paper |
| Non-clairvoyant scheduling for weighted flow time | 2009-04-28 | Paper |
| Improved Approximation Algorithm for Connected Facility Location Problems | 2009-03-03 | Paper |
| Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem | 2009-01-27 | Paper |
| Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations | 2008-05-27 | Paper |
| Optimal Construction of the City Voronoi Diagram | 2008-04-24 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE | 2006-05-29 | Paper |
| GUARDING ART GALLERIES BY GUARDING WITNESSES | 2006-05-29 | Paper |
| Algorithms for drawing binary trees in the plane. | 2006-01-17 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Optimal broadcasting with universal lists based on competitive analysis* | 2005-08-05 | Paper |
| Improved gossipings by short messages in 2-dimensional meshes | 2005-06-30 | Paper |
| THREE-DIMENSIONAL TOPOLOGICAL SWEEP FOR COMPUTING ROTATIONAL SWEPT VOLUMES OF POLYHEDRAL OBJECTS | 2005-06-10 | Paper |
| SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER | 2005-06-10 | Paper |
| Scheduling broadcasts with deadlines | 2004-10-27 | Paper |
| SEARCHING A ROOM BY TWO GUARDS | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472524 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474075 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474115 | 2004-08-04 | Paper |
| Simple algorithms for searching a polygon with flashlights | 2003-06-24 | Paper |
| Online deadline scheduling on faster machines. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551382 | 2002-09-05 | Paper |
| Approximation algorithms for general parallel task scheduling | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535039 | 2002-06-12 | Paper |
| Carrying Umbrellas: an Online Relocation Game on a Graph | 2002-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753947 | 2001-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729091 | 2001-10-18 | Paper |
| Area-efficient algorithms for straight-line tree drawings | 2001-01-29 | Paper |
| Optimal embedding of multiple directed Hamiltonian rings into \(d\)-dimensional meshes | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511226 | 2000-10-30 | Paper |
| ON COMPUTING TRANSLATIONAL SWEPT VOLUMES | 2000-05-07 | Paper |
| Scheduling parallel tasks with individual deadlines | 1999-04-28 | Paper |
| The widest k-dense corridor problems | 1999-01-12 | Paper |
| Multiple graph embeddings into a processor array with spanning buses | 1998-11-01 | Paper |
| Efficient algorithms for computing a complete visibility region in three-dimensional space | 1998-09-20 | Paper |
| Linear-time algorithms for finding the shadow volumes from a convex area light source | 1998-05-24 | Paper |
| Embedding trees in recursive circulants | 1997-04-13 | Paper |
| An optimal algorithm for finding the edge visibility polygon under limited visibility | 1997-02-28 | Paper |
| Multiple message broadcasting in communication networks | 1996-10-07 | Paper |
| Characterizing and recognizing the visibility graph of a funnel-shaped polygon | 1995-08-27 | Paper |
| On the construction of regular minimal broadcast digraphs | 1994-04-05 | Paper |
| On the number of guard edges of a polygon | 1994-01-19 | Paper |
| An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment | 1993-05-16 | Paper |
| Interpolation theorem for the number of generalized end-vertices of spanning trees | 1991-01-01 | Paper |
| Some chain visibility problems in a simple polygon | 1990-01-01 | Paper |
| An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs | 1987-01-01 | Paper |
| A new triangulation-linear class of simple polygons | 1987-01-01 | Paper |
| Parallel algorithms for a depth first search and a breadth first search | 1986-01-01 | Paper |
| On Fault Identification in Diagnosable Systems | 1981-01-01 | Paper |
| Schemes for fault-tolerant computing: A comparison of modularly redundant and t-diagnosable systems | 1981-01-01 | Paper |
