default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 107 matches
- 2024
- Matthew Ding, Jason Li:
Deterministic Minimum Steiner Cut in Maximum Flow Time. ESA 2024: 46:1-46:14 - Mingyu Xiao:
Solving Directed Multiway Cut Faster Than 2ⁿ. ESA 2024: 104:1-104:13 - Tim Randolph, Karol Wegrzycki:
Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM. ESA 2024: 96:1-96:19 - Vipul Arora, Arnab Bhattacharyya, Mathews Boban, Venkatesan Guruswami, Esty Kelman:
Outlier Robust Multivariate Polynomial Regression. ESA 2024: 12:1-12:17 - Zhiyi Huang, Zahra Parsaeian, Zixuan Zhu:
Laminar Matroid Secretary: Greedy Strikes Back. ESA 2024: 73:1-73:8 - Mohit Garg, Debajyoti Kar, Arindam Khan:
Random-Order Online Independent Set of Intervals and Hyperrectangles. ESA 2024: 58:1-58:18 - Amir Abboud, Tomer Grossman, Moni Naor, Tomer Solomon:
From Donkeys to Kings in Tournaments. ESA 2024: 3:1-3:14 - Amir Abboud, Nathan Wallheimer:
Worst-Case to Expander-Case Reductions: Derandomized and Generalized. ESA 2024: 4:1-4:18 - Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma:
Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional. ESA 2024: 5:1-5:15 - Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Lower Envelopes of Surface Patches in 3-Space. ESA 2024: 6:1-6:17 - Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir:
Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments. ESA 2024: 7:1-7:20 - Cezar-Mihail Alexandru, Christian Konrad:
Interval Selection in Sliding Windows. ESA 2024: 8:1-8:17 - Enver Aman, Karthik C. S., Sharath Punna:
On Connections Between k-Coloring and Euclidean k-Means. ESA 2024: 9:1-9:18 - Shinwoo An, Eunjin Oh, Jie Xue:
Sparse Outerstring Graphs Have Logarithmic Treewidth. ESA 2024: 10:1-10:18 - Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells:
How to Reduce Temporal Cliques to Find Sparse Spanners. ESA 2024: 11:1-11:15 - Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. ESA 2024: 13:1-13:15 - Yuhang Bai
, Kristóf Bérczi, Gergely Csáji, Tamás Schwarcz:
Approximating Maximum-Size Properly Colored Forests. ESA 2024: 14:1-14:18 - Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz:
A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. ESA 2024: 15:1-15:15 - Aranya Banerjee, Daniel Gibney, Sharma V. Thankachan:
Longest Common Substring with Gaps and Related Problems. ESA 2024: 16:1-16:18 - Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. ESA 2024: 17:1-17:15 - Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi:
Height-Bounded Lempel-Ziv Encodings. ESA 2024: 18:1-18:18 - Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Longest Common Extensions with Wildcards: Trade-Off and Applications. ESA 2024: 19:1-19:17 - Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Pattern Matching with Mismatches and Wildcards. ESA 2024: 20:1-20:15 - Tatiana Belova, Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin:
Improved Space Bounds for Subset Sum. ESA 2024: 21:1-21:17 - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. ESA 2024: 22:1-22:19 - Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring. ESA 2024: 23:1-23:18 - Therese Biedl, Prosenjit Bose, Karthik Murali:
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. ESA 2024: 24:1-24:15 - Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota:
Graph Spanners for Group Steiner Distances. ESA 2024: 25:1-25:17 - Vittorio Bilò, Evangelos Markakis, Cosimo Vinci:
Achieving Envy-Freeness Through Items Sale. ESA 2024: 26:1-26:16 - Ahmad Biniaz:
Art Galleries and Mobile Guards: Revisiting O'Rourke's Proof. ESA 2024: 27:1-27:4
skipping 77 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-11-17 15:49 CET from data curated 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:
