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 4,655 matches
- 2024
- Shi Li, Chenyang Xu, Ruilong Zhang:
Polylogarithmic Approximations for Robust s-t Path. ICALP 2024: 106:1-106:17 - Weiming Feng, Heng Guo:
An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs. ICALP 2024: 62:1-62:19 - Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche
:
Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities. ICALP 2024: 126:1-126:19 - Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian:
Streaming Algorithms for Connectivity Augmentation. ICALP 2024: 93:1-93:20 - Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio:
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. ICALP 2024: 48:1-48:18 - Dmitry Chistikov, Alessio Mansutti, Mikhail R. Starchak:
Integer Linear-Exponential Programming in NP by Quantifier Elimination. ICALP 2024: 132:1-132:20 - Yusuke Kobayashi, Tatsuya Terao:
Subquadratic Submodular Maximization with a General Matroid Constraint. ICALP 2024: 100:1-100:19 - Ce Jin, Hongxun Wu:
A Faster Algorithm for Pigeonhole Equal Sums. ICALP 2024: 94:1-94:11 - Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP 2024: 88:1-88:18 - Li Chen, Mingquan Ye:
High-Accuracy Multicommodity Flows via Iterative Refinement. ICALP 2024: 45:1-45:19 - Yu Chen, Michael Kapralov, Mikhail Makarov, Davide Mazzali:
On the Streaming Complexity of Expander Decomposition. ICALP 2024: 46:1-46:20 - Yu Chen, Zihan Tan:
Lower Bounds on 0-Extension with Steiner Nodes. ICALP 2024: 47:1-47:18 - Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely:
An O(loglog n)-Approximation for Submodular Facility Location. ICALP 2024: 5:1-5:20 - Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. ICALP 2024: 6:1-6:19 - Elie Abboud, Noga Ron-Zewi:
Finer-Grained Reductions in Fine-Grained Hardness of Approximation. ICALP 2024: 7:1-7:17 - Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese:
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. ICALP 2024: 8:1-8:20 - Rohan Acharya, Marcin Jurdzinski, Aditya Prakash:
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata. ICALP 2024: 124:1-124:18 - C. Aiswarya, Amaldev Manuel, Saina Sunny:
Edit Distance of Finite State Transducers. ICALP 2024: 125:1-125:20 - Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein:
Detecting Disjoint Shortest Paths in Linear Time and More. ICALP 2024: 9:1-9:17 - Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang:
Approximate Counting for Spin Systems in Sub-Quadratic Time. ICALP 2024: 11:1-11:20 - Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang:
The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants. ICALP 2024: 10:1-10:20 - Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Lower Bounds for Matroid Optimization Problems with a Linear Constraint. ICALP 2024: 56:1-56:20 - Ilan Doron-Arad, Joseph (Seffi) Naor:
Non-Linear Paging. ICALP 2024: 57:1-57:19 - Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam:
From Proof Complexity to Circuit Complexity via Interactive Protocols. ICALP 2024: 12:1-12:20 - Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, Carlos Palazuelos:
Learning Low-Degree Quantum Objects. ICALP 2024: 13:1-13:19 - Vikraman Arvind, Pushkar S. Joglekar:
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. ICALP 2024: 14:1-14:19 - Yossi Azar, Shahar Lewkowicz, Danny Vainstein:
List Update with Delays or Time Windows. ICALP 2024: 15:1-15:20 - Omkar Baraskar, Agrim Dewan, Chandan Saha, Pulkit Sinha:
NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials. ICALP 2024: 16:1-16:21 - Surender Baswana, Koustav Bhanja:
Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles. ICALP 2024: 17:1-17:20 - MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki:
It's Hard to HAC Average Linkage! ICALP 2024: 18:1-18:18
skipping 4,625 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-12 12:52 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:
