default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIngo van Duijn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Chen Avin, Ingo van Duijn, Maciej Pacut, Stefan Schmid
:
Self-adjusting grid networks. Inf. Comput. 292: 105038 (2023)- 2022
- [j2]Ingo van Duijn, Peter Gjøl Jensen, Jesper Stenbjerg Jensen, Troels Beck Krøgh, Jonas Sand Madsen, Stefan Schmid, Jirí Srba, Marc Tom Thorgersen:
Automata-Theoretic Approach to Verification of MPLS Networks Under Link Failures. IEEE/ACM Trans. Netw. 30(2): 766-781 (2022) - 2021
- [c8]Peter Gjøl Jensen, Stefan Schmid, Morten Konggaard Schou, Jirí Srba, Juan Vanerio, Ingo van Duijn:
Faster Pushdown Reachability Analysis with Applications in Network Verification. ATVA 2021: 170-186 - [d1]Peter Gjøl Jensen, Stefan Schmid, Morten Konggaard Schou, Jirí Srba, Juan Vanerio, Ingo van Duijn:
Repeatability Package for "Faster Pushdown Reachability Analysis with Applications in Network Verification". Zenodo, 2021
- 2020
- [c7]Peyman Afshani, Ingo van Duijn, Rasmus Killmann, Jesper Sindahl Nielsen:
A Lower Bound for Jumbled Indexing. SODA 2020: 592-606
2010 – 2019
- 2019
- [c6]Chen Avin, Ingo van Duijn, Stefan Schmid:
Self-adjusting Linear Networks. SIROCCO 2019: 332-335 - [c5]Chen Avin, Ingo van Duijn, Stefan Schmid:
Self-adjusting Linear Networks. SSS 2019: 368-382 - [i3]Chen Avin, Ingo van Duijn, Stefan Schmid:
Self-Adjusting Linear Networks. CoRR abs/1905.02472 (2019) - 2017
- [j1]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. J. Graph Algorithms Appl. 21(4): 527-546 (2017) - [c4]Peyman Afshani, Ingo van Duijn:
Permuting and Batched Geometric Lower Bounds in the I/O Model. ESA 2017: 2:1-2:13 - 2016
- [c3]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. CCCG 2016: 140-146 - [c2]Ingo van Duijn, Irina Kostitsyna, Marc J. van Kreveld, Maarten Löffler:
Critical Placements of a Square or Circle amidst Trajectories for Junction Detection. CCCG 2016: 208-215 - [c1]Peyman Afshani, Edvin Berglin, Ingo van Duijn, Jesper Sindahl Nielsen:
Applications of Incidence Bounds in Point Covering Problems. SoCG 2016: 60:1-60:15 - [i2]Peyman Afshani, Edvin Berglin, Ingo van Duijn, Jesper Sindahl Nielsen:
Applications of incidence bounds in point covering problems. CoRR abs/1603.07282 (2016) - [i1]Ingo van Duijn, Irina Kostitsyna, Marc J. van Kreveld, Maarten Löffler:
Critical Placements of a Square or Circle amidst Trajectories for Junction Detection. CoRR abs/1607.05347 (2016)
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-06-19 21:50 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:
