| Publication | Date of Publication | Type |
|---|
| On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters | 2024-09-26 | Paper |
| Complexity and algorithms for isometric path cover on chordal graphs and beyond | 2024-09-11 | Paper |
| On the cop number of string graphs | 2024-09-11 | Paper |
| Oriented total-coloring of oriented graphs | 2024-08-19 | Paper |
| Growth rate of the number of empty triangles in the plane | 2024-05-31 | Paper |
| A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes | 2024-04-10 | Paper |
| Cops and robber on butterflies, grids, and AT-free graphs | 2024-01-09 | Paper |
| Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs | 2023-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065396 | 2023-11-14 | Paper |
| Relation between broadcast domination and multipacking numbers on chordal graphs | 2023-08-17 | Paper |
| Cops and robber on oriented graphs with respect to push operation | 2023-08-17 | Paper |
| Rectilinear Voronoi games with a simple rectilinear obstacle in plane | 2023-08-17 | Paper |
| Burning a binary tree and its generalization | 2023-08-05 | Paper |
| Approximation algorithms for orthogonal line centers | 2023-08-02 | Paper |
| Complexity results on untangling red-blue matchings | 2023-07-26 | Paper |
| Complexity results on untangling red-blue matchings | 2023-06-20 | Paper |
| Voronoi games using geodesics | 2023-05-08 | Paper |
| Triangle-free projective-planar graphs with diameter two: domination and characterization | 2023-03-29 | Paper |
| A homomorphic polynomial for oriented graphs | 2023-03-21 | Paper |
| Approximating \(k\)-orthogonal line center | 2023-03-21 | Paper |
| Optimal strategies in single round Voronoi game on convex polygons with constraints | 2023-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5881923 | 2023-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5881925 | 2023-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875588 | 2023-02-03 | Paper |
| Triangle-free projective-planar graphs with diameter two: domination and characterization | 2022-12-08 | Paper |
| On clique numbers of colored mixed graphs | 2022-11-11 | Paper |
| Bumblebee visitation problem | 2022-08-04 | Paper |
| On dominating set of some subclasses of string graphs | 2022-06-13 | Paper |
| On fractional version of oriented coloring | 2022-05-30 | Paper |
| Finding a largest-area triangle in a terrain in near-linear time | 2022-03-25 | Paper |
| Approximation algorithms for orthogonal line centers | 2022-03-24 | Paper |
| A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes | 2022-03-24 | Paper |
| On degree sequences and eccentricities in pseudoline arrangement graphs | 2022-03-24 | Paper |
| Cops and robber on butterflies and solid grids | 2022-03-24 | Paper |
| The weighted \(k\)-center problem in trees for fixed \(k\) | 2022-02-21 | Paper |
| On the signed chromatic number of some classes of graphs | 2021-11-23 | Paper |
| Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions | 2021-10-21 | Paper |
| Variations of cops and robbers game on grids | 2021-10-21 | Paper |
| Cops and robber on some families of oriented graphs | 2021-09-27 | Paper |
| Voronoi game on polygons | 2021-08-11 | Paper |
| Oriented bipartite graphs and the Goldbach graph | 2021-07-08 | Paper |
| Pseudoline arrangement graphs: degree sequences and eccentricities | 2021-03-03 | Paper |
| Largest triangle inside a terrain | 2021-02-03 | Paper |
| Pushable chromatic number of graphs with degree constraints | 2021-01-21 | Paper |
| Computation of spatial skyline points | 2021-01-07 | Paper |
| On rectangle intersection graphs with stab number at most two | 2020-12-29 | Paper |
| Optimizing movement in convex and non-convex path-networks to establish connectivity | 2020-09-17 | Paper |
| Linear-time fitting of a \(k\)-step function | 2020-05-18 | Paper |
| Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints | 2020-05-18 | Paper |
| Relative clique number of planar signed graphs | 2020-05-18 | Paper |
| Cops and robber on some families of oriented graphs | 2020-02-25 | Paper |
| Dominating set on overlap graphs of rectangles intersecting a line | 2020-02-24 | Paper |
| Approximating minimum dominating set on string graphs | 2020-02-24 | Paper |
| The 1-dimensional discrete Voronoi game | 2020-02-10 | Paper |
| On rectangle intersection graphs with stab number at most two | 2019-10-10 | Paper |
| Bumblebee visitation problem | 2019-10-10 | Paper |
| The relative signed clique number of planar graphs is 8 | 2019-10-10 | Paper |
| The discrete Voronoi game in a simple polygon | 2019-10-07 | Paper |
| Bounds on the bend number of split and cocomparability graphs | 2019-09-05 | Paper |
| Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function | 2019-04-26 | Paper |
| The discrete Voronoi game in \(\mathbb{R}^2\) | 2018-11-01 | Paper |
| On relative clique number of colored mixed graphs | 2018-10-12 | Paper |
| Variations of cops and robbers game on grids | 2018-06-05 | Paper |
| Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions | 2018-06-05 | Paper |
| Burning spiders | 2018-06-05 | Paper |
| On oriented \(L(p,1)\)-labeling | 2018-06-05 | Paper |
| A study on oriented relative clique number | 2018-05-24 | Paper |
| Optimizing squares covering a set of points | 2018-05-17 | Paper |
| The $p$-Center Problem in Tree Networks Revisited | 2017-10-17 | Paper |
| Optimal \(L(3, 2, 1)\)-labeling of triangular lattice | 2017-06-19 | Paper |
| On Chromatic Number of Colored Mixed Graphs | 2017-04-07 | Paper |
| Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity | 2017-04-07 | Paper |
| A lower bound technique for radio \(k\)-coloring | 2017-02-27 | Paper |
| Geometric p-Center Problems with Centers Constrained to Two Lines | 2017-02-01 | Paper |
| On Local Structures of Cubicity 2 Graphs | 2017-02-01 | Paper |
| On representing a simple polygon perceivable to a blind person | 2017-01-31 | Paper |
| On oriented relative clique number | 2016-10-17 | Paper |
| On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice | 2016-10-17 | Paper |
| Almost empty monochromatic triangles in planar point sets | 2016-06-22 | Paper |
| Chromatic number of signed graphs with bounded maximum degree | 2016-03-31 | Paper |
| Linear-Time Fitting of a k-Step Function | 2016-03-23 | Paper |
| Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints | 2016-03-23 | Paper |
| Relative Clique Number of Planar Signed Graphs | 2016-03-23 | Paper |
| Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points | 2016-03-14 | Paper |
| Forbidden substructure for interval digraphs/bigraphs | 2015-12-08 | Paper |
| Optimizing Squares Covering a Set of Points | 2015-09-11 | Paper |
| A Facility Coloring Problem in 1-D | 2015-05-20 | Paper |
| On a Special Class of Boxicity 2 Graphs | 2015-02-19 | Paper |
| Voronoi game on graphs | 2014-12-02 | Paper |
| Recognition and characterization of chronological interval digraphs | 2014-08-14 | Paper |
| Minimum enclosing circle of a set of fixed points and a mobile point | 2014-08-13 | Paper |
| Disjoint empty convex pentagons in planar point sets | 2014-07-21 | Paper |
| Two-Round Discrete Voronoi Game along a Line | 2014-04-03 | Paper |
| On pseudo-convex partitions of a planar point set | 2014-01-20 | Paper |
| Minimum-width rectangular annulus | 2013-12-19 | Paper |
| On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation | 2013-12-17 | Paper |
| Optimal strategies for the one-round discrete Voronoi game on a line | 2013-12-09 | Paper |
| Circular‐Arc Bigraphs and Its Subclasses | 2013-07-31 | Paper |
| The Discrete Voronoi Game in a Simple Polygon | 2013-06-11 | Paper |
| Voronoi Game on Graphs | 2013-04-12 | Paper |
| Some variations on constrained minimum enclosing circle problem | 2013-03-25 | Paper |
| Holes or empty pseudo-triangles in planar point sets | 2013-02-28 | Paper |
| Localized geometric query problems | 2013-01-25 | Paper |
| Base station placement on boundary of a convex polygon | 2012-07-26 | Paper |
| On the minimum size of a point set containing a 5-hole and a disjoint 4-hole | 2012-04-26 | Paper |
| Optimal Strategies for the One-Round Discrete Voronoi Game on a Line | 2011-08-17 | Paper |
| Minimum Width Rectangular Annulus | 2011-06-03 | Paper |
| Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point | 2011-02-20 | Paper |
| Some Variations on Constrained Minimum Enclosing Circle Problem | 2011-01-08 | Paper |
| Covering a set of points in a plane using two parallel rectangles | 2010-08-20 | Paper |
| A new fast heuristic for labeling points | 2010-08-16 | Paper |
| Fast computation of smallest enclosing circle with center on a query line segment | 2010-06-09 | Paper |
| Approximation algorithms for shortest descending paths in terrains | 2010-05-25 | Paper |
| Computation of Non-dominated Points Using Compact Voronoi Diagrams | 2010-02-09 | Paper |
| A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion | 2010-02-09 | Paper |
| GUARD PLACEMENT FOR MAXIMIZING L-VISIBILITY EXTERIOR TO A CONVEX POLYGON | 2010-02-01 | Paper |
| Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set | 2010-01-29 | Paper |
| Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation | 2009-12-04 | Paper |
| SMALLEST COLOR-SPANNING OBJECT REVISITED | 2009-11-23 | Paper |
| Homogeneous 2-hop broadcast in 2D | 2009-11-16 | Paper |
| Constrained minimum enclosing circle with center on a query line segment | 2009-07-27 | Paper |
| Optimal algorithm for a special point-labeling problem | 2009-07-09 | Paper |
| Single facility collection depots location problem in the plane | 2009-06-18 | Paper |
| Homogeneous 2-Hops Broadcast in 2D | 2009-02-03 | Paper |
| Optimal Guard Placement Problem Under L-Visibility | 2009-01-27 | Paper |
| VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION | 2008-09-25 | Paper |
| Guarding Exterior Region of a Simple Polygon | 2008-03-25 | Paper |
| Constrained Minimum Enclosing Circle with Center on a Query Line Segment | 2007-09-05 | Paper |
| Computational Science and Its Applications – ICCSA 2004 | 2007-07-19 | Paper |
| Chronological Orderings of Interval Digraph | 2007-05-29 | Paper |
| Shortest monotone descent path problem in polyhedral terrain | 2007-04-18 | Paper |
| Efficient algorithm for placing a given number of base stations to cover a convex region | 2007-01-09 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| Simple algorithms for partial point set pattern matching under rigid motion | 2006-08-16 | Paper |
| Range assignment for energy efficient broadcasting in linear radio networks | 2006-03-24 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046479 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046483 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437495 | 2003-12-02 | Paper |
| Largest empty rectangle among a point set | 2003-08-13 | Paper |
| An efficient \(k\) nearest neighbors searching algorithm for a query line. | 2003-05-25 | Paper |
| Counting the minimum number of arcs in an oriented graph having weak diameter 2 | N/A | Paper |
| On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters | N/A | Paper |
