Ljubomir Perković

From MaRDI portal
Revision as of 00:47, 10 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Ljubomir Perković to Ljubomir Perković: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:270005

Available identifiers

zbMath Open perkovic.ljubomirMaRDI QIDQ270005

List of research outcomes

PublicationDate of PublicationType
The Stretch Factor of Hexagon-Delaunay Triangulations2023-11-02Paper
https://portal.mardi4nfdi.de/entity/Q50776462022-05-18Paper
There are Plane Spanners of Maximum Degree 42018-04-23Paper
Degree Four Plane Spanners: Simpler and Better2018-01-30Paper
Upper and lower bounds for online routing on Delaunay triangulations2017-10-10Paper
Degree four plane spanners: Simpler and better2017-03-30Paper
On the ordered list subgraph embedding problems2016-04-06Paper
Upper and Lower Bounds for Online Routing on Delaunay Triangulations2015-11-19Paper
There are plane spanners of degree 4 and moderate stretch factor2015-06-18Paper
AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH2015-04-29Paper
Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations2014-12-23Paper
On the ordered list subgraph embedding problems2013-12-10Paper
https://portal.mardi4nfdi.de/entity/Q49107372013-03-19Paper
The Stretch Factor of L 1- and L  ∞ -Delaunay Triangulations2012-09-25Paper
On Spanners and Lightweight Spanners of Geometric Graphs2011-01-17Paper
Plane Spanners of Maximum Degree Six2010-09-07Paper
Computing Lightweight Spanners Locally2008-11-20Paper
Genus characterizes the complexity of certain graph problems: Some tight results2007-08-23Paper
Bounding the firing synchronization problem on a ring2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44492242004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q47085882003-06-18Paper
Inexpensive d‐dimensional matchings2002-06-05Paper
https://portal.mardi4nfdi.de/entity/Q49449742000-10-08Paper
Edge coloring regular graphs of high degree1998-12-15Paper
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem1994-04-28Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ljubomir Perković