Ljubomir Perkovic

Publication Activity (10 Years)

Years Active: 1993-2021
Publications (10 Years): 8

Top Topics

Upper And Lower Bounds

Delaunay Triangulations

Top Venues

Discret. Comput. Geom.

J. Comput. Geom.

Publications

Ljubomir Perkovic, Michael Dennis, Duru Türkoglu
The Stretch Factor of Hexagon-Delaunay Triangulations. J. Comput. Geom. 12 (2) (2021)
Michael Dennis, Ljubomir Perkovic, Duru Türkoglu
The Stretch Factor of Hexagon-Delaunay Triangulations. SoCG (2020)
Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. Discret. Comput. Geom. 58 (2) (2017)
Michael Dennis, Ljubomir Perkovic, Duru Türkoglu
The Stretch Factor of Hexagon-Delaunay Triangulations. CoRR (2017)
Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu
Degree four plane spanners: Simpler and better. J. Comput. Geom. 8 (2) (2017)
Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu
Degree Four Plane Spanners: Simpler and Better. CoRR (2016)
Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu
Degree Four Plane Spanners: Simpler and Better. SoCG (2016)
Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
On the Ordered List Subgraph Embedding Problems. Algorithmica 74 (3) (2016)
Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. ESA (2015)
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
There are Plane Spanners of Degree 4 and Moderate Stretch Factor. Discret. Comput. Geom. 53 (3) (2015)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
-Delaunay triangulations. Comput. Geom. 48 (3) (2015)
Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. CoRR (2015)
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
There are Plane Spanners of Maximum Degree 4. CoRR (2014)
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
There are Plane Spanners of Maximum Degree 4. SoCG (2014)
Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
On the Ordered List Subgraph Embedding Problems. CoRR (2014)
Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
On the Ordered List Subgraph Embedding Problems. IPEC (2013)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
-Delaunay Triangulations CoRR (2012)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. ESA (2012)
Ljubomir Perkovic, Amber Settle, Sungsoon Hwang, Joshua Jones
A framework for computational thinking across the curriculum. ITiCSE (2010)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
Plane Spanners of Maximum Degree Six. ICALP (1) (2010)
Craig S. Miller, Ljubomir Perkovic, Amber Settle
File references, trees, and computational thinking. ITiCSE (2010)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
On Spanners and Lightweight Spanners of Geometric Graphs. SIAM J. Comput. 39 (6) (2010)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. IEEE Trans. Mob. Comput. 8 (4) (2009)
Iyad A. Kanj, Ljubomir Perkovic
On Geometric Spanners of Euclidean and Unit Disk Graphs CoRR (2008)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
Computing Lightweight Spanners Locally. DISC (2008)
Iyad A. Kanj, Ljubomir Perkovic
On Geometric Spanners of Euclidean and Unit Disk Graphs. STACS (2008)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. DIALM-POMC (2007)
Suleyman Uludag, Ljubomir Perkovic, Anna Kashkanova, Kemal Akkaya
Quality-of-service provisioning via stochastic path selection under Weibullian link delays. QSHINE (2007)
Ljubomir Perkovic, Amber Settle
Computing Branches Out: On Revitalizing Computing Education. FECS (2007)
Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
Genus characterizes the complexity of certain graph problems: Some tight results. J. Comput. Syst. Sci. 73 (6) (2007)
Iyad A. Kanj, Ljubomir Perkovic
Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. ALGOSENSORS (2006)
André Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon
Bounding the firing synchronization problem on a ring. Theor. Comput. Sci. 320 (2-3) (2004)
Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
Genus Characterizes the Complexity of Graph Problems: Some Tight Results. ICALP (2003)
André Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon
New Bounds for the Firing Squad Problem on a Ring. SIROCCO (2002)
Iyad A. Kanj, Ljubomir Perkovic
Improved Parameterized Algorithms for Planar Dominating Set. MFCS (2002)
Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz
Inexpensive d-dimensional matchings. Random Struct. Algorithms 20 (1) (2002)
Ljubomir Perkovic, Bruce A. Reed
An Improved Algorithm for Finding Tree Decompositions of Small Width. Int. J. Found. Comput. Sci. 11 (3) (2000)
Ljubomir Perkovic, Bruce A. Reed
An Improved Algorithm for Finding Tree Decompositions of Small Width. WG (1999)
Ljubomir Perkovic, Bruce A. Reed
Edge coloring regular graphs of high degree. Discret. Math. (1997)
Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Comb. Probab. Comput. 2 (1993)