default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLjubomir Perkovic
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Ljubomir Perkovic, Michael Dennis, Duru Türkoglu:
The Stretch Factor of Hexagon-Delaunay Triangulations. J. Comput. Geom. 12(2): 86-125 (2021)- 2020
- [c19]Michael Dennis, Ljubomir Perkovic, Duru Türkoglu:
The Stretch Factor of Hexagon-Delaunay Triangulations. SoCG 2020: 34:1-34:16
2010 – 2019
- 2017
- [j13]Nicolas Bonichon, Prosenjit Bose
, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. Discret. Comput. Geom. 58(2): 482-504 (2017) - [j12]Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu:
Degree four plane spanners: Simpler and better. J. Comput. Geom. 8(2): 3-31 (2017) - [i7]Michael Dennis, Ljubomir Perkovic, Duru Türkoglu:
The Stretch Factor of Hexagon-Delaunay Triangulations. CoRR abs/1711.00068 (2017) - 2016
- [j11]Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. Algorithmica 74(3): 992-1018 (2016) - [c18]Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu:
Degree Four Plane Spanners: Simpler and Better. SoCG 2016: 45:1-45:15 - [i6]Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu:
Degree Four Plane Spanners: Simpler and Better. CoRR abs/1603.03818 (2016) - 2015
- [j10]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
Tight stretch factors for L1- and L∞-Delaunay triangulations. Comput. Geom. 48(3): 237-250 (2015) - [j9]Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Degree 4 and Moderate Stretch Factor. Discret. Comput. Geom. 53(3): 514-546 (2015) - [c17]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. ESA 2015: 203-214 - [i5]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. CoRR abs/1501.01783 (2015) - 2014
- [c16]Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Maximum Degree 4. SoCG 2014: 20 - [i4]Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. CoRR abs/1403.2009 (2014) - [i3]Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Maximum Degree 4. CoRR abs/1403.5350 (2014) - 2013
- [c15]Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. IPEC 2013: 189-201 - 2012
- [c14]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. ESA 2012: 205-216 - [i2]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
The Stretch Factor of L1- and L∞-Delaunay Triangulations. CoRR abs/1202.5127 (2012) - 2010
- [j8]Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
On Spanners and Lightweight Spanners of Geometric Graphs. SIAM J. Comput. 39(6): 2132-2161 (2010) - [c13]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
Plane Spanners of Maximum Degree Six. ICALP (1) 2010: 19-30 - [c12]Ljubomir Perkovic, Amber Settle, Sungsoon Hwang, Joshua Jones:
A framework for computational thinking across the curriculum. ITiCSE 2010: 123-127 - [c11]Craig S. Miller, Ljubomir Perkovic, Amber Settle:
File references, trees, and computational thinking. ITiCSE 2010: 132-136
2000 – 2009
- 2009
- [j7]Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. IEEE Trans. Mob. Comput. 8(4): 460-474 (2009) - 2008
- [c10]Iyad A. Kanj, Ljubomir Perkovic:
On Geometric Spanners of Euclidean and Unit Disk Graphs. STACS 2008: 409-420 - [c9]Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
Computing Lightweight Spanners Locally. DISC 2008: 365-378 - [i1]Iyad A. Kanj, Ljubomir Perkovic:
On Geometric Spanners of Euclidean and Unit Disk Graphs. CoRR abs/0802.2864 (2008) - 2007
- [j6]Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia:
Genus characterizes the complexity of certain graph problems: Some tight results. J. Comput. Syst. Sci. 73(6): 892-907 (2007) - [c8]Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. DIALM-POMC 2007 - [c7]Ljubomir Perkovic, Amber Settle:
Computing Branches Out: On Revitalizing Computing Education. FECS 2007: 22-27 - [c6]Suleyman Uludag, Ljubomir Perkovic, Anna Kashkanova, Kemal Akkaya:
Quality-of-service provisioning via stochastic path selection under Weibullian link delays. QSHINE 2007: 11 - 2006
- [c5]Iyad A. Kanj, Ljubomir Perkovic:
Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. ALGOSENSORS 2006: 95-106 - 2004
- [j5]André Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon:
Bounding the firing synchronization problem on a ring. Theor. Comput. Sci. 320(2-3): 213-228 (2004) - 2003
- [c4]Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia:
Genus Characterizes the Complexity of Graph Problems: Some Tight Results. ICALP 2003: 845-856 - 2002
- [j4]Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz:
Inexpensive d-dimensional matchings. Random Struct. Algorithms 20(1): 50-58 (2002) - [c3]Iyad A. Kanj, Ljubomir Perkovic:
Improved Parameterized Algorithms for Planar Dominating Set. MFCS 2002: 399-410 - [c2]André Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon:
New Bounds for the Firing Squad Problem on a Ring. SIROCCO 2002: 17-31 - 2000
- [j3]Ljubomir Perkovic, Bruce A. Reed:
An Improved Algorithm for Finding Tree Decompositions of Small Width. Int. J. Found. Comput. Sci. 11(3): 365-371 (2000)
1990 – 1999
- 1999
- [c1]Ljubomir Perkovic, Bruce A. Reed:
An Improved Algorithm for Finding Tree Decompositions of Small Width. WG 1999: 148-154 - 1997
- [j2]Ljubomir Perkovic, Bruce A. Reed:
Edge coloring regular graphs of high degree. Discret. Math. 165-166: 567-578 (1997) - 1993
- [j1]Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani:
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Comb. Probab. Comput. 2: 271-284 (1993)
Coauthor Index
aka: Iyad A. Kanj
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
