default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJustin Dallant
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Justin Dallant
, John Iacono:
How fast can we play Tetris greedily with rectangular pieces? Theor. Comput. Sci. 992: 114405 (2024)- [c10]Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher:
An Improved Lower Bound on the Number of Pseudoline Arrangements. SoCG 2024: 43:1-43:18 - [c9]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
An Optimal Randomized Algorithm for Finding the Saddlepoint. ESA 2024: 44:1-44:12 - [c8]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
Finding the saddlepoint faster than sorting. SOSA 2024: 168-178 - [c7]Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. SOSA 2024: 215-223 - [i11]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
An Optimal Randomized Algorithm for Finding the Saddlepoint. CoRR abs/2401.06512 (2024) - [i10]Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher:
An Improved Lower Bound on the Number of Pseudoline Arrangements. CoRR abs/2402.13107 (2024) - [i9]Justin Dallant:
Improved Lower Bound on the Number of Pseudoline Arrangements. CoRR abs/2402.13923 (2024) - 2023
- [c6]Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara:
The Rectilinear Convex Hull of Line Segments. FCT 2023: 32-45 - [i8]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
Finding the saddlepoint faster than sorting. CoRR abs/2310.16801 (2023) - [i7]Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. CoRR abs/2311.12471 (2023) - [i6]Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant:
Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports 13(5): 114-135 (2023) - 2022
- [j1]Justin Dallant, Patrick Schnider:
Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem. Comput. Geom. Topol. 1(1): 5:1-5:27 (2022) - [c5]Justin Dallant, John Iacono:
Conditional Lower Bounds for Dynamic Geometric Measure Problems. ESA 2022: 39:1-39:17 - [c4]Justin Dallant, John Iacono:
How Fast Can We Play Tetris Greedily with Rectangular Pieces? FUN 2022: 13:1-13:19 - [i5]Justin Dallant, John Iacono:
How Fast Can We Play Tetris Greedily With Rectangular Pieces? CoRR abs/2202.10771 (2022) - 2021
- [c3]Jean Cardinal, Justin Dallant, John Iacono:
Approximability of (Simultaneous) Class Cover for Boxes. CCCG 2021: 149-156 - [c2]Justin Dallant, Patrick Schnider:
Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem. CCCG 2021: 157-166 - [c1]Jean Cardinal, Justin Dallant, John Iacono:
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. ESA 2021: 24:1-24:14 - [i4]Jean Cardinal, Justin Dallant, John Iacono:
An Instance-optimal Algorithm for Bichromatic Rectangular Visibility. CoRR abs/2106.05638 (2021) - [i3]Jean Cardinal, Justin Dallant, John Iacono:
Approximability of (Simultaneous) Class Cover for Boxes. CoRR abs/2106.12969 (2021) - [i2]Justin Dallant, John Iacono:
Conditional Lower Bounds for Dynamic Geometric Measure Problems. CoRR abs/2112.10095 (2021) - 2020
- [i1]Justin Dallant, Patrick Schnider:
Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner (p, q)-theorem. CoRR abs/2002.06947 (2020)
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-09-26 01:00 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:
