| Publication | Date of Publication | Type |
|---|
Area-efficient algorithms for upward straight-line tree drawings
Lecture Notes in Computer Science | 2024-01-29 | Paper |
| Scheduling parallel tasks with individual deadlines | 2023-03-21 | Paper |
| Directed hamiltonian packing in d-dimensional meshes and its application | 2023-01-25 | Paper |
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Tight analysis of a self-approaching strategy for the online kernel-search problem
Information Processing Letters | 2016-06-16 | Paper |
Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems
Journal of Computer and System Sciences | 2016-06-13 | Paper |
Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
Information Sciences | 2015-09-23 | Paper |
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science | 2014-01-13 | Paper |
Farthest Voronoi diagrams under travel time metrics (extended abstract)
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
The balloon popping problem revisited: lower and upper bounds
Theory of Computing Systems | 2011-11-23 | Paper |
Scheduling broadcasts with deadlines
Lecture Notes in Computer Science | 2011-03-18 | Paper |
A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
Journal of Combinatorial Optimization | 2009-12-02 | Paper |
The balloon popping problem revisited: lower and upper bounds
Algorithmic Game Theory | 2009-12-01 | Paper |
Computing minimum-area rectilinear convex hull and \(L\)-shape
Computational Geometry | 2009-08-14 | Paper |
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters | 2009-07-21 | Paper |
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Frontiers in Algorithmics | 2009-07-14 | Paper |
Labeling points with given rectangles
Information Processing Letters | 2009-07-09 | Paper |
OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
International Journal of Computational Geometry & Applications | 2009-06-30 | Paper |
Casting an object with a core
Algorithmica | 2009-06-16 | Paper |
Approximation algorithms for connected facility location problems
Journal of Combinatorial Optimization | 2009-05-04 | Paper |
Non-clairvoyant scheduling for weighted flow time
Information Processing Letters | 2009-04-28 | Paper |
Improved Approximation Algorithm for Connected Facility Location Problems
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
Algorithms and Computation | 2008-05-27 | Paper |
Optimal Construction of the City Voronoi Diagram
Algorithms and Computation | 2008-04-24 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
GUARDING ART GALLERIES BY GUARDING WITNESSES
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
Algorithms for drawing binary trees in the plane.
Information Processing Letters | 2006-01-17 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Optimal broadcasting with universal lists based on competitive analysis*
Networks | 2005-08-05 | Paper |
Improved gossipings by short messages in 2-dimensional meshes
Journal of Parallel and Distributed Computing | 2005-06-30 | Paper |
SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
THREE-DIMENSIONAL TOPOLOGICAL SWEEP FOR COMPUTING ROTATIONAL SWEPT VOLUMES OF POLYHEDRAL OBJECTS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Scheduling broadcasts with deadlines
Theoretical Computer Science | 2004-10-27 | Paper |
SEARCHING A ROOM BY TWO GUARDS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 2080273 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080980 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081014 (Why is no real title available?) | 2004-08-04 | Paper |
Simple algorithms for searching a polygon with flashlights
Information Processing Letters | 2003-06-24 | Paper |
Online deadline scheduling on faster machines.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1796987 (Why is no real title available?) | 2002-09-05 | Paper |
Approximation algorithms for general parallel task scheduling
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1754612 (Why is no real title available?) | 2002-06-12 | Paper |
Carrying umbrellas: An online relocation game on a graph
Journal of Graph Algorithms and Applications | 2002-01-07 | Paper |
| scientific article; zbMATH DE number 1670669 (Why is no real title available?) | 2001-12-19 | Paper |
| scientific article; zbMATH DE number 1629972 (Why is no real title available?) | 2001-10-18 | Paper |
Area-efficient algorithms for straight-line tree drawings
Computational Geometry | 2001-01-29 | Paper |
Optimal embedding of multiple directed Hamiltonian rings into \(d\)-dimensional meshes
Journal of Parallel and Distributed Computing | 2000-11-07 | Paper |
| scientific article; zbMATH DE number 1522930 (Why is no real title available?) | 2000-10-30 | Paper |
ON COMPUTING TRANSLATIONAL SWEPT VOLUMES
International Journal of Computational Geometry & Applications | 2000-05-07 | Paper |
Scheduling parallel tasks with individual deadlines
Theoretical Computer Science | 1999-04-28 | Paper |
The widest k-dense corridor problems
Information Processing Letters | 1999-01-12 | Paper |
Multiple graph embeddings into a processor array with spanning buses
Journal of Parallel and Distributed Computing | 1998-11-01 | Paper |
Efficient algorithms for computing a complete visibility region in three-dimensional space
Algorithmica | 1998-09-20 | Paper |
Linear-time algorithms for finding the shadow volumes from a convex area light source
Algorithmica | 1998-05-24 | Paper |
Embedding trees in recursive circulants
Discrete Applied Mathematics | 1997-04-13 | Paper |
An optimal algorithm for finding the edge visibility polygon under limited visibility
Information Processing Letters | 1997-02-28 | Paper |
Multiple message broadcasting in communication networks
Networks | 1996-10-07 | Paper |
Characterizing and recognizing the visibility graph of a funnel-shaped polygon
Algorithmica | 1995-08-27 | Paper |
On the construction of regular minimal broadcast digraphs
Theoretical Computer Science | 1994-04-05 | Paper |
On the number of guard edges of a polygon
Discrete & Computational Geometry | 1994-01-19 | Paper |
An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
Journal of Algorithms | 1993-05-16 | Paper |
Interpolation theorem for the number of generalized end-vertices of spanning trees
IEEE Transactions on Circuits and Systems | 1991-01-01 | Paper |
Some chain visibility problems in a simple polygon
Algorithmica | 1990-01-01 | Paper |
A new triangulation-linear class of simple polygons
International Journal of Computer Mathematics | 1987-01-01 | Paper |
An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
Information Processing Letters | 1987-01-01 | Paper |
Parallel algorithms for a depth first search and a breadth first search
International Journal of Computer Mathematics | 1986-01-01 | Paper |
Schemes for fault-tolerant computing: A comparison of modularly redundant and t-diagnosable systems
Information and Control | 1981-01-01 | Paper |
On Fault Identification in Diagnosable Systems
IEEE Transactions on Computers | 1981-01-01 | Paper |
