Остановите войну!
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 60 matches
- 2018
- Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. STACS 2018: 39:1-39:14 - Marco Bressan, Enoch Peserico, Luca Pretto:
On Approximating the Stationary Distribution of Time-reversible Markov Chains. STACS 2018: 18:1-18:14 - Anna Adamaszek, Antonios Antoniadis, Amit Kumar, Tobias Mömke:
Approximating Airports and Railways. STACS 2018: 5:1-5:13 - Isolde Adler, Frederik Harwath:
Property Testing for Bounded Degree Databases. STACS 2018: 6:1-6:14 - Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Erdös-Pósa Property of Obstructions to Interval Graphs. STACS 2018: 7:1-7:15 - Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
All Classical Adversary Methods are Equivalent for Total Functions. STACS 2018: 8:1-8:14 - Max Bannach, Till Tantau:
Computing Hitting Set Kernels By AC0-Circuits. STACS 2018: 9:1-9:14 - Rémy Belmonte, Michael Lampis, Valia Mitsou:
Parameterized (Approximate) Defective Coloring. STACS 2018: 10:1-10:15 - Christoph Berkholz:
The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs. STACS 2018: 11:1-11:14 - Olaf Beyersdorff, Joshua Blinkhorn:
Genuine Lower Bounds for QBF Expansion. STACS 2018: 12:1-12:15 - Laurent Bienvenu, Rodney G. Downey:
On Low for Speed Oracles. STACS 2018: 15:1-15:13 - Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti:
Efficient Oracles and Routing Schemes for Replacement Paths. STACS 2018: 13:1-13:15 - Davide Bilò, Pascal Lenzner:
On the Tree Conjecture for the Network Creation Game. STACS 2018: 14:1-14:15 - Michael Blondin, Javier Esparza, Stefan Jaax:
Large Flocks of Small Birds: on the Minimal Size of Population Protocols. STACS 2018: 16:1-16:14 - Benedikt Bollig, Marie Fortin, Paul Gastin:
Communicating Finite-State Machines and Two-Variable Logic. STACS 2018: 17:1-17:14 - Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný:
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. STACS 2018: 19:1-19:15 - Bernadette Charron-Bost, Shlomo Moran:
The Firing Squad Problem Revisited. STACS 2018: 20:1-20:14 - Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. STACS 2018: 21:1-21:15 - Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya:
Upper and Lower Bounds for Dynamic Data Structures on Strings. STACS 2018: 22:1-22:14 - Debarati Das, Michal Koucký, Michael E. Saks:
Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. STACS 2018: 23:1-23:14 - Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy:
Solving the Rubik's Cube Optimally is NP-complete. STACS 2018: 24:1-24:13 - Gökalp Demirci, Henry Hoffmann, David H. K. Kim:
Approximation Algorithms for Scheduling with Resource and Precedence Constraints. STACS 2018: 25:1-25:14 - Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS 2018: 26:1-26:15 - László Egri, Dániel Marx, Pawel Rzazewski:
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. STACS 2018: 27:1-27:15 - Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Small Resolution Proofs for QBF using Dependency Treewidth. STACS 2018: 28:1-28:15 - Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
Lossy Kernels for Connected Dominating Set on Sparse Graphs. STACS 2018: 29:1-29:15 - Lukas Fleischer, Manfred Kufleitner:
The Intersection Problem for Finite Monoids. STACS 2018: 30:1-30:14 - Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, Konstantinos Mamouras:
Automata Theory on Sliding Windows. STACS 2018: 31:1-31:14 - Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche:
Knapsack Problems for Wreath Products. STACS 2018: 32:1-32:13 - Robert Ganian, Fabian Klute, Sebastian Ordyniak:
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. STACS 2018: 33:1-33:14
skipping 30 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-04-19 06:28 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