Ljubomir Perković
Ljubomir Perković
Professor, School of Computing, DePaul University
Dirección de correo verificada de cs.depaul.edu
TítuloCitado porAño
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
Improved parameterized algorithms for planar dominating set
IA Kanj, L Perković
International Symposium on Mathematical Foundations of Computer Science, 399-410, 2002
An improved algorithm for finding tree decompositions of small width
L Perković, B Reed
International Workshop on Graph-Theoretic Concepts in Computer Science, 148-154, 1999
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
Edge coloring regular graphs of high degree
L Perkovic, B Reed
Discrete Mathematics 165, 567-578, 1997
Plane spanners of maximum degree six
N Bonichon, C Gavoille, N Hanusse, L Perković
Automata, Languages and Programming, 19-30, 2010
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
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
On Geometric Spanners of Euclidean and Unit Disk Graphs
L Perkovic, IA Kanj
25th International Symposium on Theoretical Aspects of Computer Science 1 …, 2008
Computational thinking across the curriculum: a conceptual framework
A Settle, L Perkovic
On spanners and lightweight spanners of geometric graphs
IA Kanj, L Perkovic, G Xia
SIAM Journal on Computing 39 (6), 2132-2161, 2010
The Stretch Factor of L 1- and L  ∞ -Delaunay Triangulations
N Bonichon, C Gavoille, N Hanusse, L Perković
European Symposium on Algorithms, 205-216, 2012
Computing lightweight spanners locally
IA Kanj, L Perković, G Xia
International Symposium on Distributed Computing, 365-378, 2008
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
Local construction of near-optimal power spanners for wireless ad hoc networks
IA Kanj, L Perković, G Xia
IEEE Transactions on Mobile Computing 8 (4), 460-474, 2009
Computational Thinking across the Curriculum: A Conceptual Framework
L Perkovic, A Settle
College of Computing and Digital Media Technical Report, 10-001, 2010
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
File references, trees, and computational thinking
CS Miller, L Perković, A Settle
Proceedings of the fifteenth annual conference on Innovation and technology …, 2010
Improved stretch factor for bounded-degree planar power spanners of wireless ad-hoc networks
IA Kanj, L Perković
International Symposium on Algorithms and Experiments for Sensor Systems …, 2006
Degree four plane spanners: Simpler and better
I Kanj, L Perković, D Türkoǧlu
Journal of Computational Geometry 8 (2), 3--31, 2017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20