default search action
Aleksandar Markovic 0001
Person information
- affiliation: TU Eindhoven, The Netherlands
Other persons with the same name
- Aleksandar Markovic 0002
— University of Belgrade, Belgrade, Serbia
- Aleksandar Markovic 0003
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j5]Mark de Berg, Aleksandar Markovic, Seeun William Umboh
The Online Broadcast Range-Assignment Problem. Algorithmica 85(12): 3928-3956 (2023) - 2021
- [j4]Elena Arseneva
Rectilinear link diameter and radius in a rectilinear polygonal domain. Comput. Geom. 92: 101685 (2021) - 2020
- [j3]Boris Aronov
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces. Algorithmica 82(5): 1081-1100 (2020) - [c6]Mark de Berg
The Online Broadcast Range-Assignment Problem. ISAAC 2020: 60:1-60:15 - [i5]Mark de Berg, Aleksandar Markovic, Seeun William Umboh:
The Online Broadcast Range-Assignment Problem. CoRR abs/2009.14473 (2020)
2010 – 2019
- 2019
- [j2]Mark de Berg
Dynamic conflict-free colorings in the plane. Comput. Geom. 78: 61-73 (2019) - [j1]Mark de Berg
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. Int. J. Comput. Geom. Appl. 29(1): 49-72 (2019) - 2018
- [c5]Boris Aronov
Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. COCOON 2018: 567-578 - [c4]Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen:
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. ISAAC 2018: 58:1-58:13 - [i4]Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. CoRR abs/1805.02538 (2018) - 2017
- [c3]Kevin Buchin
Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution). SoCG 2017: 64:1-64:5 - [c2]Mark de Berg
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. ISAAC 2017: 26:1-26:13 - [c1]Mark de Berg
Dynamic Conflict-Free Colorings in the Plane. ISAAC 2017: 27:1-27:13 - [i3]Mark de Berg, Tim Leijsen, André van Renssen, Marcel Roeloffzen, Aleksandar Markovic, Gerhard J. Woeginger:
Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. CoRR abs/1701.03388 (2017) - [i2]Mark de Berg, Aleksandar Markovic:
Dynamic Conflict-Free Colorings in the Plane. CoRR abs/1709.10466 (2017) - [i1]Man-Kwun Chiu, Elena Khramtcova, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen:
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. CoRR abs/1712.05538 (2017)
Coauthor Index
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 2024-10-07 21:25 CEST 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: