Ljubomir Perkovic

According to our database, Ljubomir Perkovic authored at least 30 papers between 1993 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2021

The Stretch Factor of Hexagon-Delaunay Triangulations.

Ljubomir Perkovic, Michael Dennis, Duru Türkoglu

J. Comput. Geom., 2021

2017

Degree four plane spanners: Simpler and better.

Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu

J. Comput. Geom., 2017

Upper and Lower Bounds for Online Routing on Delaunay Triangulations.

Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen

Discret. Comput. Geom., 2017

2016

On the Ordered List Subgraph Embedding Problems.

Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic

Algorithmica, 2016

2015

There are Plane Spanners of Degree 4 and Moderate Stretch Factor.

Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia

Discret. Comput. Geom., 2015

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations.

Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen

CoRR, 2015

Tight stretch factors for L₁- and L_∞-Delaunay triangulations.

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic

Comput. Geom., 2015

2014

There are Plane Spanners of Maximum Degree 4.

Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2012

The Stretch Factor of L₁- and L_∞-Delaunay Triangulations

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic

CoRR, 2012

The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations.

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic

Proceedings of the Algorithms - ESA 2012, 2012

2010

On Spanners and Lightweight Spanners of Geometric Graphs.

Iyad A. Kanj, Ljubomir Perkovic, Ge Xia

SIAM J. Comput., 2010

A framework for computational thinking across the curriculum.

Ljubomir Perkovic, Amber Settle, Sungsoon Hwang, Joshua Jones

Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2010

File references, trees, and computational thinking.

Craig S. Miller, Ljubomir Perkovic, Amber Settle

Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2010

Plane Spanners of Maximum Degree Six.

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks.

Iyad A. Kanj, Ljubomir Perkovic, Ge Xia

IEEE Trans. Mob. Comput., 2009

2008

Computing Lightweight Spanners Locally.

Iyad A. Kanj, Ljubomir Perkovic, Ge Xia

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

On Geometric Spanners of Euclidean and Unit Disk Graphs.

Iyad A. Kanj, Ljubomir Perkovic

Proceedings of the STACS 2008, 2008

2007

Genus characterizes the complexity of certain graph problems: Some tight results.

Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia

J. Comput. Syst. Sci., 2007

Quality-of-service provisioning via stochastic path selection under Weibullian link delays.

Suleyman Uludag, Ljubomir Perkovic, Anna Kashkanova, Kemal Akkaya

Proceedings of the 4th International ICST Conference on Heterogeneous Networking for Quality, 2007

Computing Branches Out: On Revitalizing Computing Education.

Ljubomir Perkovic, Amber Settle

Proceedings of the 2007 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2007

Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks.

Iyad A. Kanj, Ljubomir Perkovic, Ge Xia

Proceedings of the DIALM-POMC International Workshop on Foundations of Mobile Computing, 2007

2006

Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks.

Iyad A. Kanj, Ljubomir Perkovic

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2004

Bounding the firing synchronization problem on a ring.

André Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon

Theor. Comput. Sci., 2004

2003

Genus Characterizes the Complexity of Graph Problems: Some Tight Results.

Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Inexpensive d-dimensional matchings.

Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz

Random Struct. Algorithms, 2002

New Bounds for the Firing Squad Problem on a Ring.

André Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon

Proceedings of the SIROCCO 9, 2002

Improved Parameterized Algorithms for Planar Dominating Set.

Iyad A. Kanj, Ljubomir Perkovic

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2000

An Improved Algorithm for Finding Tree Decompositions of Small Width.

Ljubomir Perkovic, Bruce A. Reed

Int. J. Found. Comput. Sci., 2000

1997

Edge coloring regular graphs of high degree.

Ljubomir Perkovic, Bruce A. Reed

Discret. Math., 1997

1993

A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem.

Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani

Comb. Probab. Comput., 1993