Остановите войну!
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 22 matches
- 2009
- Oana Andrei, Hélène Kirchner:
A Higher-Order Graph Calculus for Autonomic Computing. Graph Theory, Computational Intelligence and Thought 2009: 15-26 - Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182 - Andreas Brandstädt, Raffaele Mosca:
On Distance-3 Matchings and Induced Matchings. Graph Theory, Computational Intelligence and Thought 2009: 116-126 - Domingos Moreira Cardoso, Vadim V. Lozin:
Dominating Induced Matchings. Graph Theory, Computational Intelligence and Thought 2009: 77-86 - L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs. Graph Theory, Computational Intelligence and Thought 2009: 148-157 - Fanica Gavril:
Algorithms on Subtree Filament Graphs. Graph Theory, Computational Intelligence and Thought 2009: 27-35 - Fanica Gavril, Alon Itai:
Covering a Tree by a Forest. Graph Theory, Computational Intelligence and Thought 2009: 66-76 - Martin Charles Golumbic:
Landmarks in Algorithmic Graph Theory: A Personal Retrospective. Graph Theory, Computational Intelligence and Thought 2009: 1-14 - Georg Gottlob, Gianluigi Greco, Bruno Marnette:
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results. Graph Theory, Computational Intelligence and Thought 2009: 87-99 - Georg Gottlob, Gianluigi Greco, Zoltán Miklós, Francesco Scarcello, Thomas Schwentick:
Tree Projections: Game Characterization and Computational Aspects. Graph Theory, Computational Intelligence and Thought 2009: 217-226 - Gregory Z. Gutin, Daniel Karapetyan:
Local Search Heuristics for the Multidimensional Assignment Problem. Graph Theory, Computational Intelligence and Thought 2009: 100-115 - Gregory Z. Gutin, Eun Jung Kim:
Properly Coloured Cycles and Paths: Results and Open Problems. Graph Theory, Computational Intelligence and Thought 2009: 200-208 - Irith Ben-Arroyo Hartman:
On Path Partitions and Colourings in Digraphs. Graph Theory, Computational Intelligence and Thought 2009: 134-143 - Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell:
O(m logn) Split Decomposition of Strongly Connected Graphs. Graph Theory, Computational Intelligence and Thought 2009: 158-171 - Yulia Kempner, Vadim E. Levit:
Recognition of Antimatroidal Point Sets. Graph Theory, Computational Intelligence and Thought 2009: 209-216 - Mark Korenblit, Vadim E. Levit:
A Note on the Recognition of Nested Graphs. Graph Theory, Computational Intelligence and Thought 2009: 36-40 - Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán:
Combinatorial Problems for Horn Clauses. Graph Theory, Computational Intelligence and Thought 2009: 54-65 - Vadim E. Levit, Eugen Mandrescu:
On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph. Graph Theory, Computational Intelligence and Thought 2009: 127-133 - Vadim E. Levit, David Tankus:
On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6. Graph Theory, Computational Intelligence and Thought 2009: 144-147 - Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Asynchronous Congestion Games. Graph Theory, Computational Intelligence and Thought 2009: 41-53 - András Sebö:
Path Partitions, Cycle Covers and Integer Decomposition. Graph Theory, Computational Intelligence and Thought 2009: 183-199 - Marina Lipshteyn, Vadim E. Levit, Ross M. McConnell:
Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 5420, Springer 2009, ISBN 978-3-642-02028-5 [contents]
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-10 15:49 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