Остановите войну!
for scientists:
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 2,270 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) - 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) - Marat Kh. Faizrahmanov:
On Non-principal Arithmetical Numberings and Families. Theory Comput. Syst. 68(2): 271-282 (2024) - Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. Theory Comput. Syst. 68(1): 103-121 (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) - 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) - Andreas Maletti, Andreea-Teodora Nász:
Weighted Tree Automata with Constraints. Theory Comput. Syst. 68(1): 1-28 (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) - Marcus Schaefer, Daniel Stefankovic:
Beyond the Existential Theory of the Reals. Theory Comput. Syst. 68(2): 195-226 (2024) - K. Subramani, Piotr Wojciechowki, Alvaro Velasquez:
Farkas Bounds on Horn Constraint Systems. Theory Comput. Syst. 68(2): 227-249 (2024) - Qisheng Wang, Mingsheng Ying:
Quantum Algorithm for Lexicographically Minimal String Rotation. Theory Comput. Syst. 68(1): 29-74 (2024) - 2023
- Daniel Apon, William Gasarch, Kevin Lawler:
The Complexity of Grid Coloring. Theory Comput. Syst. 67(3): 521-547 (2023) - Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. 67(4): 785-824 (2023) - Dietmar Berwanger, Laurent Doyen:
Observation and Distinction: Representing Information in Infinite Games. Theory Comput. Syst. 67(1): 4-27 (2023) - Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen:
Subclasses of Ptime Interpreted by Programming Languages. Theory Comput. Syst. 67(3): 437-472 (2023) - Philip Bille, Inge Li Gørtz:
Random Access in Persistent Strings and Segment Selection. Theory Comput. Syst. 67(4): 694-713 (2023) - Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. Theory Comput. Syst. 67(6): 1241-1267 (2023) - Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann:
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Theory Comput. Syst. 67(1): 28-51 (2023) - Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle:
Typical Sequences Revisited - Computing Width Parameters of Graphs. Theory Comput. Syst. 67(1): 52-88 (2023) - David E. Brown, David Skidmore:
Representing the Integer Factorization Problem Using Ordered Binary Decision Diagrams. Theory Comput. Syst. 67(6): 1307-1332 (2023) - Onur Çagirici:
On Embeddability of Unit Disk Graphs Onto Straight Lines. Theory Comput. Syst. 67(2): 264-289 (2023) - Rodolfo Conde, Sergio Rajsbaum:
The Solvability of Consensus in Iterated Models Extended with Safe-Consensus. Theory Comput. Syst. 67(5): 901-955 (2023) - Andrés Cristi, Mathieu Mari, Andreas Wiese:
Fixed-Parameter Algorithms for Unsplittable Flow Cover. Theory Comput. Syst. 67(1): 89-124 (2023) - Andreas Darmann:
Stability and Welfare in (Dichotomous) Hedonic Diversity Games. Theory Comput. Syst. 67(6): 1133-1155 (2023) - Yefim Dinitz, Shlomi Dolev, Manish Kumar:
Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs. Theory Comput. Syst. 67(2): 348-382 (2023) - Henning Fernau, Kshitij Gajjar:
The Space Complexity of Sum Labelling. Theory Comput. Syst. 67(5): 1026-1049 (2023) - Henning Fernau, Mikhail V. Volkov:
Preface of the Special Issue Dedicated to Selected Papers from CSR 2020. Theory Comput. Syst. 67(2): 219-220 (2023) - Zhiguo Fu, Jin-Yi Cai:
Holographic Algorithms on Domains of General Size. Theory Comput. Syst. 67(3): 417-436 (2023) - Kaoru Fujioka:
On the Hierarchy of Swarm-automaton for the Number of Agents. Theory Comput. Syst. 67(4): 714-731 (2023) - David Furcy, Scott M. Summers, Logan Withers:
Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D. Theory Comput. Syst. 67(5): 1082-1130 (2023)
skipping 2,240 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-05-28 09:07 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