![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 54 matches
- 2002
- Maria I. Andreou, Dimitris Fotakis
, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. MFCS 2002: 81-92 - Ola Angelsmark, Vilhelm Dahllöf, Peter Jonsson:
Finite Domain Constraint Satisfaction Using Quantum Computation. MFCS 2002: 93-103 - Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
Fast Algorithms with Algebraic Monge Properties. MFCS 2002: 104-117 - Mihalis Beis, William Duckworth, Michele Zito:
Packing Edges in Random Regular Graphs. MFCS 2002: 118-130 - Michel Bidoit, Donald Sannella
, Andrzej Tarlecki:
Global Development via Local Observational Construction Steps. MFCS 2002: 1-24 - Beate Bollig, Philipp Woelfel:
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. MFCS 2002: 131-142 - Endre Boros, Khaled M. Elbassioni
, Vladimir Gurvich, Leonid Khachiyan:
Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS 2002: 143-154 - Olivier Carton
:
Accessibility in Automata on Scattered Linear Orderings. MFCS 2002: 155-164 - Didier Caucal:
On Infinite Terms Having a Decidable Monadic Theory. MFCS 2002: 165-176 - Didier Caucal, Teodor Knapik:
A Chomsky-Like Hierarchy of Infinite Graphs. MFCS 2002: 177-187 - Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong
:
Competitive Analysis of On-line Stream Merging Algorithms. MFCS 2002: 188-200 - Amin Coja-Oghlan:
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. MFCS 2002: 201-211 - Robert Dabrowski, Wojciech Plandowski:
On Word Equations in One Variable. MFCS 2002: 212-220 - Todd Ebert, Wolfgang Merkle:
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits. MFCS 2002: 221-233 - Joost Engelfriet, Sebastian Maneth:
Two-Way Finite State Transducers with Nested Pebbles. MFCS 2002: 234-244 - Leah Epstein, Lene M. Favrholdt:
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines. MFCS 2002: 245-256 - Leah Epstein, Csanád Imreh, Rob van Stee:
More on Weighted Servers or FIFO is Better than LRU. MFCS 2002: 257-268 - Aleksei V. Fishkin, Guochuan Zhang
:
On Maximizing the Throughput of Multiprocessor Tasks. MFCS 2002: 269-279 - Alan Gibbons, Paul Sant:
Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps. MFCS 2002: 25-39 - Andreas Goerdt, Tomasz Jurdzinski:
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. MFCS 2002: 280-291 - Richard Groult, Martine Léonard, Laurent Mouchard:
Evolutive Tandem Repeats Using Hamming Distance. MFCS 2002: 292-304 - Mohammad Taghi Hajiaghayi, Naomi Nishimura:
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. MFCS 2002: 305-318 - Mika Hirvensalo, Juhani Karhumäki:
Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example. MFCS 2002: 319-327 - Lucian Ilie, Sheng Yu:
Algorithms for Computing Small NFAs. MFCS 2002: 328-340 - Shunsuke Inenaga, Ayumi Shinohara
, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa:
Space-Economical Construction of Index Structures for All Suffixes of a String. MFCS 2002: 341-352 - Kazuo Iwama, Hiroki Morizumi:
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits. MFCS 2002: 353-364 - Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai:
Computational Complexity in the Hyperbolic Plane. MFCS 2002: 365-374 - Ryszard Janicki:
On a Mereological System for Relational Software Specifications. MFCS 2002: 375-386 - Jan Johannsen, N. S. Narayanaswamy:
An Optimal Lower Bound for Resolution with 2-Conjunctions. MFCS 2002: 387-398 - Iyad A. Kanj, Ljubomir Perkovic:
Improved Parameterized Algorithms for Planar Dominating Set. MFCS 2002: 399-410
skipping 24 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-18 23:40 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