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)

Edge coloring regular graphs of high degree. - Ljubomir Perkovic; Bruce A. Reed (Discret. Math., 1997)

An Improved Algorithm for Finding Tree Decompositions of Small Width. - Ljubomir Perkovic; Bruce A. Reed (Int. J. Found. Comput. Sci., 2000)

Improved Parameterized Algorithms for Planar Dominating Set. - Iyad A. Kanj; Ljubomir Perkovic (MFCS, 2002)

New Bounds for the Firing Squad Problem on a Ring. - André Berthiaume; Ljubomir Perkovic; Amber Settle; Janos Simon (SIROCCO, 2002)

Inexpensive d-dimensional matchings. - Bae-Shi Huang; Ljubomir Perkovic; Eric Schmutz (Random Struct. Algorithms, 2002)

Genus Characterizes the Complexity of Graph Problems: Some Tight Results. - Jianer Chen; Iyad A. Kanj; Ljubomir Perkovic; Eric Sedgwick; Ge Xia (ICALP, 2003)

Bounding the firing synchronization problem on a ring. - André Berthiaume; Todd Bittner; Ljubomir Perkovic; Amber Settle; Janos Simon (Theor. Comput. Sci., 2004)

Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. - Iyad A. Kanj; Ljubomir Perkovic (ALGOSENSORS, 2006)

Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (DIALM-POMC, 2007)

Computing Branches Out: On Revitalizing Computing Education. - Ljubomir Perkovic; Amber Settle (FECS, 2007)

Quality-of-service provisioning via stochastic path selection under Weibullian link delays. - Suleyman Uludag; Ljubomir Perkovic; Anna Kashkanova; Kemal Akkaya (QSHINE, 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)

On Geometric Spanners of Euclidean and Unit Disk Graphs. - Iyad A. Kanj; Ljubomir Perkovic (STACS, 2008)

Computing Lightweight Spanners Locally. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (DISC, 2008)

Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (IEEE Trans. Mob. Comput., 2009)

Plane Spanners of Maximum Degree Six. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (ICALP (1), 2010)

File references, trees, and computational thinking. - Craig S. Miller; Ljubomir Perkovic; Amber Settle (ITiCSE, 2010)

A framework for computational thinking across the curriculum. - Ljubomir Perkovic; Amber Settle; Sungsoon Hwang; Joshua Jones (ITiCSE, 2010)

On Spanners and Lightweight Spanners of Geometric Graphs. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (SIAM J. Comput., 2010)

The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (ESA, 2012)

The Stretch Factor of L1- and L∞-Delaunay Triangulations - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (CoRR, 2012)

There are Plane Spanners of Maximum Degree 4. - Nicolas Bonichon; Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (SoCG, 2014)

Tight stretch factors for L1- and L∞-Delaunay triangulations. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (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)

There are Plane Spanners of Degree 4 and Moderate Stretch Factor. - Nicolas Bonichon; Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (Discret. Comput. Geom., 2015)

On the Ordered List Subgraph Embedding Problems. - Olawale Hassan; Iyad A. Kanj; Daniel Lokshtanov; Ljubomir Perkovic (Algorithmica, 2016)

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)

Degree four plane spanners: Simpler and better. - Iyad A. Kanj; Ljubomir Perkovic; Duru Türkoglu (J. Comput. Geom., 2017)

The Stretch Factor of Hexagon-Delaunay Triangulations. - Ljubomir Perkovic; Michael Dennis 001; Duru Türkoglu (J. Comput. Geom., 2021)