Person:270005

Available identifiers

zbMath Open perkovic.ljubomirMaRDI QIDQ270005

List of research outcomes

Publication	Date of Publication	Type
The Stretch Factor of Hexagon-Delaunay Triangulations	2023-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q5077646	2022-05-18	Paper
There are Plane Spanners of Maximum Degree 4	2018-04-23	Paper
Degree Four Plane Spanners: Simpler and Better	2018-01-30	Paper
Upper and lower bounds for online routing on Delaunay triangulations	2017-10-10	Paper
Degree four plane spanners: Simpler and better	2017-03-30	Paper
On the ordered list subgraph embedding problems	2016-04-06	Paper
Upper and Lower Bounds for Online Routing on Delaunay Triangulations	2015-11-19	Paper
There are plane spanners of degree 4 and moderate stretch factor	2015-06-18	Paper
AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH	2015-04-29	Paper
Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations	2014-12-23	Paper
On the ordered list subgraph embedding problems	2013-12-10	Paper
https://portal.mardi4nfdi.de/entity/Q4910737	2013-03-19	Paper
The Stretch Factor of L 1- and L  ∞ -Delaunay Triangulations	2012-09-25	Paper
On Spanners and Lightweight Spanners of Geometric Graphs	2011-01-17	Paper
Plane Spanners of Maximum Degree Six	2010-09-07	Paper
Computing Lightweight Spanners Locally	2008-11-20	Paper
Genus characterizes the complexity of certain graph problems: Some tight results	2007-08-23	Paper
Bounding the firing synchronization problem on a ring	2004-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4449224	2004-02-08	Paper
https://portal.mardi4nfdi.de/entity/Q4708588	2003-06-18	Paper
Inexpensive d‐dimensional matchings	2002-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q4944974	2000-10-08	Paper
Edge coloring regular graphs of high degree	1998-12-15	Paper
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem	1994-04-28	Paper

Research outcomes over time

This page was built for person: Ljubomir Perković