Personal information

No personal information available

Activities

Works (36)

The Stretch Factor of Hexagon-Delaunay Triangulations

36th International Symposium on Computational Geometry, SoCG 2020, June 23-26, 2020, Zürich, Switzerland
2020 | Conference paper
Contributors: Ljubomir Perkovic
Source: Self-asserted source
Ljubomir Perkovic

Degree Four Plane Spanners: Simpler and Better

Journal of Computational Geometry
2017 | Journal article
Contributors: Ljubomir Perkovic
Source: Self-asserted source
Ljubomir Perkovic

Upper and Lower Bounds for Online Routing on Delaunay Triangulations

Discrete & Computational Geometry
2017 | Journal article
Contributors: Ljubomir Perkovic
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.4230/LIPIcs.SoCG.2016.45Degree Four Plane Spanners: Simpler and Better

Proceedings of the 32nd International Symposium on Computational Geometry, SoCG 2016
2016 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

On the Ordered List Subgraph Embedding Problems

Algorithmica
2016 | Journal article
Contributors: Ljubomir Perkovic
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1007/978-3-662-48350-3_18Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations

Proceedings of the 23rd Annual European Symposium on Algorithms (ESA 2015)
2015 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1016/j.comgeo.2014.10.005Tight stretch factors for $L_1$- and $L_∞$-Delaunay triangulations

Computational Geometry: Theory and Applications
2015 | Journal article
Source: Self-asserted source
Ljubomir Perkovic

Introduction to Computing Using Python, 2nd Edition

2015 | Book
Contributors: Ljubomir Perkovic
Source: Self-asserted source
Ljubomir Perkovic

There are Plane Spanners of Degree 4 and Moderate Stretch Factor

Discrete & Computational Geometry
2015 | Journal article
Contributors: Ljubomir Perkovic
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://doi.acm.org/10.1145/2582112.2582141There are Plane Spanners of Maximum Degree 4

Proceedings of the 30th Annual Symposium on Computational Geometry (SoCG 2014)
2014 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1007/978-3-319-03898-8_17On the Ordered List Subgraph Embedding Problems

Proceedings of the 8th International Symposium on Parameterized and Exact Computation (IPEC 2013)
2013 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1007/978-3-642-33090-2_19The Stretch Factor of L 1- and L \(∞\) -Delaunay Triangulations

Proceedings of the 20th Annual European Symposium on Algorithms (ESA 2012)
2012 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://www.wiley.com/WileyCDA/WileyTitle/productCd-EHEP002019.htmlIntroduction to Computing Using Python

2012 | Book
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://hal.inria.fr/inria-00476151/Comment résumer le plan

Proceedings of the 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel 2010)
2010 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

A framework for computational thinking across the curriculum

Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education (ITiCSE 2010)
2010 | Conference paper
Contributors: Ljubomir Perkovic
Source: Self-asserted source
Ljubomir Perkovic

File references, trees, and computational thinking

Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, (ITiCSE 2010)
2010 | Conference paper
Contributors: Ljubomir Perkovic
Source: Self-asserted source
Ljubomir Perkovic

On Spanners and Lightweight Spanners of Geometric Graphs

SIAM Journal on Computing
2010 | Journal article
Contributors: Ljubomir Perkovic
Source: Self-asserted source
Ljubomir Perkovic

Plane Spanners of Maximum Degree Six

Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010)
2010 | Conference paper
Contributors: Ljubomir Perkovic
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://doi.ieeecomputersociety.org/10.1109/TMC.2008.132Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
2009 | Journal article
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1007/978-3-540-87779-0_25Computing Lightweight Spanners Locally

Proceedings of the 22nd International Symposium on Distributed Computing, (DISC 2008)
2008 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.4230/LIPIcs.STACS.2008.1320On Geometric Spanners of Euclidean and Unit Disk Graphs

Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2008)
2008 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://doi.acm.org/10.1145/1577222.1577238Quality-of-service provisioning via stochastic path selection under Weibullian link delays

4th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE 2007)
2007 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1016/j.jcss.2006.11.001Genus characterizes the complexity of certain graph problems: Some tight results

Journal of Computer and System Sciences
2007 | Journal article
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://reed.cs.depaul.edu/lperkovic/papers/pomc-07.pdfStrictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks

Proceedings of the DIALM-POMC International Workshop on Foundations of Mobile Computing, (CD-ROM)
2007 | Conference paper
Part of ISBN: 978-1-59593-874-9
Source: Self-asserted source
Ljubomir Perkovic

Computing Branches Out: On Revitalizing Computing Education

Proceedings of the 2007 International Conference on Frontiers in Education: Computer Science & Computer Engineering (FECS 2007)
2007 | Conference paper
Contributors: Ljubomir Perkovic
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1007/11963271_9Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks

Proceedings of the Second International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2006)
2006 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

A case for application-aware grid services

International Conference on Computing in High Energy and Nuclear Physics 2006 (CHEP'06)
2006 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1016/j.tcs.2004.01.036Bounding the firing synchronization problem on a ring

Theoretical Computer Science
2004 | Journal article
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1007/3-540-45061-0_66Genus Characterizes the Complexity of Graph Problems: Some Tight Results

Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003)
2003 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1007/3-540-45687-2_33Improved Parameterized Algorithms for Planar Dominating Set

Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002)
2002 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://onlinelibrary.wiley.com/doi/10.1002/rsa.10027/abstractInexpensive d-dimensional matchings

Random Structures and Algorithms
2002 | Journal article
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://reed.cs.depaul.edu/lperkovic/papers/sirocco-02.pdfNew Bounds for the Firing Squad Problem on a Ring

Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO 9)
2002 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1142/S0129054100000247An Improved Algorithm for Finding Tree Decompositions of Small Width

International Journal of Foundations of Computer Science
2000 | Journal article
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1007/3-540-46784-X_15An Improved Algorithm for Finding Tree Decompositions of Small Width

Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '99)
1999 | Conference paper
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1016/S0012-365X(96)00202-6 Edge coloring regular graphs of high degree

Discrete Mathematics
1997 | Journal article
Source: Self-asserted source
Ljubomir Perkovic

\hrefhttp://dx.doi.org/10.1017/S0963548300000675A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem

Combinatorics, Probability & Computing
1993 | Journal article
Source: Self-asserted source
Ljubomir Perkovic