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 37 matches
- 2024
- Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs. Theory Comput. Syst. 68(1): 144-193 (2024) - Aaron Bernstein:
Improved Bounds for Matching in Random-Order Streams. Theory Comput. Syst. 68(4): 758-772 (2024) - Markus Bläser, Benjamin Monmege:
Preface of STACS 2021 Special Issue. Theory Comput. Syst. 68(4): 835-837 (2024) - Silvia Butti
, Víctor Dalmau:
The Complexity of the Distributed Constraint Satisfaction Problem. Theory Comput. Syst. 68(4): 838-867 (2024) - Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On Polynomial Recursive Sequences. Theory Comput. Syst. 68(4): 593-614 (2024) - Yijie Chen, Kewei Lv:
New Results on the Remote Set Problem and Its Applications in Complexity Study. Theory Comput. Syst. 68(2): 283-298 (2024) - Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han:
On the Decidability of Infix Inclusion Problem. Theory Comput. Syst. 68(3): 301-321 (2024) - Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida:
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. Theory Comput. Syst. 68(4): 868-899 (2024) - Pankaj Kumar Das, Subodh Kumar:
Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance. Theory Comput. Syst. 68(3): 512-528 (2024) - Anuj Dawar:
International Colloquium on Automata, Languages and Programming (ICALP 2020). Theory Comput. Syst. 68(4): 591-592 (2024) - Joel D. Day, Vijay Ganesh, Nathan Grewal, Matthew Konefal, Florin Manea:
A Closer Look at the Expressive Power of Logics Based on Word Equations. Theory Comput. Syst. 68(3): 322-379 (2024) - Joel D. Day, Florin Manea:
On the structure of solution-sets to regular word equations. Theory Comput. Syst. 68(4): 662-739 (2024) - Volker Diekert, Mikhail Volkov:
Preface of the Special Issue Dedicated to Selected Papers from DLT 2022. Theory Comput. Syst. 68(3): 299-300 (2024) - Marat Kh. Faizrahmanov:
On Non-principal Arithmetical Numberings and Families. Theory Comput. Syst. 68(2): 271-282 (2024) - Uriel Feige, Vadim Grinberg:
How to Hide a Clique? Theory Comput. Syst. 68(4): 773-813 (2024) - Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. Theory Comput. Syst. 68(1): 103-121 (2024) - Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Minimum Cut in O(mlog 2 n) Time. Theory Comput. Syst. 68(4): 814-834 (2024) - Stefan Göller, Mathieu Hilaire:
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete. Theory Comput. Syst. 68(4): 900-985 (2024) - Frank Gurski, Jörg Rothe, Robin Weishaupt:
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes. Theory Comput. Syst. 68(1): 75-102 (2024) - Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Digraph Coloring and Distance to Acyclicity. Theory Comput. Syst. 68(4): 986-1013 (2024) - Jacob Holm, Eva Rotenberg:
Good r-divisions Imply Optimal Amortized Decremental Biconnectivity. Theory Comput. Syst. 68(4): 1014-1048 (2024) - Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß:
Equation Satisfiability in Solvable Groups. Theory Comput. Syst. 68(4): 740-757 (2024) - Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. Theory Comput. Syst. 68(4): 1049-1081 (2024) - Ondrej Klíma, Jonatan Kolegar:
Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words. Theory Comput. Syst. 68(3): 380-402 (2024) - Hoàng-Oanh Le, Van Bang Le:
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. Theory Comput. Syst. 68(2): 250-270 (2024) - Markus Lohrey:
Subgroup Membership in GL(2,Z). Theory Comput. Syst. 68(4): 1082-1107 (2024) - Markus Lohrey, Florian Stober, Armin Weiß:
The Power Word Problem in Graph Products. Theory Comput. Syst. 68(3): 403-464 (2024) - Andreas Maletti, Andreea-Teodora Nász:
Weighted Tree Automata with Constraints. Theory Comput. Syst. 68(1): 1-28 (2024) - Cornelis A. Middelburg:
Imperative Process Algebra and Models of Parallel Computation. Theory Comput. Syst. 68(3): 529-570 (2024) - Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski:
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective. Theory Comput. Syst. 68(1): 122-143 (2024)
skipping 7 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-04 04:28 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:
