default search action
Search 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 59 matches
- 2023
- Seok-Hee Hong:
Faithful Graph Drawing (Invited Talk). ISAAC 2023: 2:1-2:1 - Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm:
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. ISAAC 2023: 13:1-13:18 - Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis:
Substring Complexity in Sublinear Space. ISAAC 2023: 12:1-12:19 - Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz:
Reconfiguration of the Union of Arborescences. ISAAC 2023: 48:1-48:14 - Yusuke Kobayashi, Takashi Noguchi:
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover. ISAAC 2023: 49:1-49:10 - Shuai Shao, Stanislav Zivný:
A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees. ISAAC 2023: 57:1-57:17 - Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, Dirk Nowotka:
k-Universality of Regular Languages. ISAAC 2023: 4:1-4:21 - Jungho Ahn, Jinha Kim, O-joung Kwon:
Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes. ISAAC 2023: 5:1-5:19 - Hugo A. Akitaya, Maike Buchin, Majid Mirzanezhad, Leonie Ryvkin, Carola Wenk:
Realizability of Free Spaces of Curves. ISAAC 2023: 3:1-3:20 - Henk Alkema, Mark de Berg:
Geometric TSP on Sets. ISAAC 2023: 6:1-6:19 - Kazuyuki Amano:
Depth-Three Circuits for Inner Product and Majority Functions. ISAAC 2023: 7:1-7:16 - Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Non-Clairvoyant Makespan Minimization Scheduling with Predictions. ISAAC 2023: 9:1-9:15 - Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya:
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. ISAAC 2023: 10:1-10:17 - Mark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous:
Clustering in Polygonal Domains. ISAAC 2023: 23:1-23:15 - Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Finding Diverse Minimum s-t Cuts. ISAAC 2023: 24:1-24:17 - Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski:
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. ISAAC 2023: 11:1-11:13 - Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen:
Improved Guarantees for the a Priori TSP. ISAAC 2023: 14:1-14:16 - Michaela Borzechowski, Patrick Schnider, Simon Weber:
An FPT Algorithm for Splitting a Necklace Among Two Thieves. ISAAC 2023: 15:1-15:14 - Cornelius Brand, Alexandra Lassota:
Fast Convolutions for Near-Convex Sequences. ISAAC 2023: 16:1-16:16 - Diptarka Chakraborty, Sanjana Dey:
Matrix Completion: Approximating the Minimum Diameter. ISAAC 2023: 17:1-17:19 - Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang:
Distance Queries over Dynamic Interval Graphs. ISAAC 2023: 18:1-18:19 - Huairui Chu, Bingkai Lin:
FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set. ISAAC 2023: 19:1-19:20 - Tomer Cohen, Ariel Kulik, Hadas Shachnai:
Improved Approximation for Two-Dimensional Vector Multiple Knapsack. ISAAC 2023: 20:1-20:17 - Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
A Compact DAG for Storing and Searching Maximal Common Subsequences. ISAAC 2023: 21:1-21:15 - Nicola Cotumaccio:
Prefix Sorting DFAs: A Recursive Algorithm. ISAAC 2023: 22:1-22:15 - Anubhav Dhar, Soumita Hait, Sudeshna Kolay:
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. ISAAC 2023: 25:1-25:17 - Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Rectilinear-Upward Planarity Testing of Digraphs. ISAAC 2023: 26:1-26:20 - Yann Disser, Nils Mosis:
A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules. ISAAC 2023: 27:1-27:17 - Edith Elkind:
Group Fairness: From Multiwinner Voting to Participatory Budgeting (Invited Talk). ISAAC 2023: 1:1-1:3 - Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Approximation Guarantees for Shortest Superstrings: Simpler and Better. ISAAC 2023: 29:1-29:17
skipping 29 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-10-08 22:26 CEST 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