Ljubomir Perkovic

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