Follow
Ljubomir Perković
Ljubomir Perković
Professor, School of Computing, DePaul University
Verified email at cs.depaul.edu
Title
Cited by
Cited by
Year
A framework for computational thinking across the curriculum
L Perković, A Settle, S Hwang, J Jones
Proceedings of the fifteenth annual conference on Innovation and technology …, 2010
1622010
Improved parameterized algorithms for planar dominating set
IA Kanj, L Perković
Mathematical Foundations of Computer Science 2002: 27th International …, 2002
862002
An improved algorithm for finding tree decompositions of small width
L Perković, B Reed
International Journal of Foundations of Computer Science 11 (03), 365-371, 2000
792000
A mildly exponential time algorithm for approximating the number of solutions to a multidimensional knapsack problem
M Dyer, A Frieze, R Kannan, A Kapoor, L Perkovic, U Vazirani
Combinatorics, Probability and Computing 2 (3), 271-284, 1993
711993
Edge coloring regular graphs of high degree
L Perkovic, B Reed
Discrete Mathematics 165, 567-578, 1997
441997
Plane spanners of maximum degree six
N Bonichon, C Gavoille, N Hanusse, L Perković
International Colloquium on Automata, Languages and Programming (ICALP), 19-30, 2010
412010
Computational thinking across the curriculum: a conceptual framework
A Settle, L Perkovic
392010
Introduction to computing using python: An application development focus
L Perkovic
John Wiley & Sons, 2015
362015
Bounding the firing synchronization problem on a ring
A Berthiaume, T Bittner, L Perković, A Settle, J Simon
Theoretical Computer Science 320 (2-3), 213-228, 2004
312004
On geometric spanners of Euclidean and unit disk graphs
IA Kanj, L Perkovic
25th International Symposium on Theoretical Aspects of Computer Science 1 …, 2008
292008
Upper and lower bounds for online routing on Delaunay triangulations
N Bonichon, P Bose, JL De Carufel, L Perković, A Van Renssen
Discrete & Computational Geometry 58 (2), 482-504, 2017
252017
The Stretch Factor of L1- and L ∞ -Delaunay Triangulations
N Bonichon, C Gavoille, N Hanusse, L Perković
European Symposium on Algorithms, 205-216, 2012
232012
Computational Thinking across the Curriculum: A Conceptual Framework
L Perkovic, A Settle
College of Computing and Digital Media Technical Report, 10-001, 2010
232010
On spanners and lightweight spanners of geometric graphs
IA Kanj, L Perkovic, G Xia
SIAM Journal on Computing 39 (6), 2132-2161, 2010
232010
Computing lightweight spanners locally
IA Kanj, L Perković, G Xia
International Symposium on Distributed Computing, 365-378, 2008
232008
Degree four plane spanners: Simpler and better
I Kanj, L Perković, D Türkoǧlu
32nd International Symposium on Computational Geometry, SoCG 2016 51, 45:1 …, 2016
212016
Genus characterizes the complexity of certain graph problems: Some tight results
J Chen, IA Kanj, L Perković, E Sedgwick, G Xia
Journal of Computer and System Sciences 73 (6), 892-907, 2007
202007
There are plane spanners of degree 4 and moderate stretch factor
N Bonichon, I Kanj, L Perković, G Xia
Discrete & Computational Geometry 53 (3), 514-546, 2015
192015
Tight Stretch Factors for L1-and L∞-Delaunay Triangulations
N Bonichon, C Gavoille, N Hanusse, L Perković
Computational Geometry: Theory and Applications 48 (3), 237-250, 2015
162015
An improved algorithm for finding tree decompositions of small tree width
L Perkovic, B Reed
Proceedings of the 25th International Workshop on Graph Theoretic Concepts …, 1999
16*1999
The system can't perform the operation now. Try again later.
Articles 1–20