Остановите войну!
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 58 matches
- 2004
- Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav:
Coloring Graphs with Minimal Edge Load. CTW 2004: 16-20 - Méziane Aïder:
Extended Distance-Hereditary Graphs. CTW 2004: 21-23 - Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar:
Virtual Private Network Design Under Traffic Uncertainty. CTW 2004: 24-27 - C. Àlvarez, N. Serna:
The Proper Interval Colored Graph Problem for Caterpillar Trees. CTW 2004: 28-32 - Edoardo Amaldi, Leo Liberti, Francesco Maffioli:
Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. CTW 2004: 33-36 - Roberto Aringhieri, Maurizio Bruglieri, Federico Malucelli, Maddalena Nonato:
An Asymmetric Vehicle Routing Problem arising in the Collection and Disposal of Special Waste. CTW 2004: 41-46 - Roberto Aringhieri, Roberto Cordone:
The Multicommodity Multilevel Bottleneck Assignment Problem. CTW 2004: 37-40 - Armen S. Asratian:
A New Local Condition for a Graph to be Hamiltonian. CTW 2004: 47-49 - Wolfgang W. Bein:
Knowledge State Algorithms and the 2-Server Problem. CTW 2004: 50 - Pietro Belotti, Federico Malucelli:
Network Design with Grooming Constraints. CTW 2004: 51-55 - Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. CTW 2004: 56-60 - Valentin E. Brimkov:
Clique, Chromatic, and Lovász Numbers of Certain Circulant Graphs. CTW 2004: 61-65 - Tobias Brüggemann, Walter Kern:
An Improved Local Search Algorithm for 3-SAT. CTW 2004: 66-70 - Miroslava Cajkova, Veerle Fack:
Clique Algorithms for Classifying Substructures in Generalized Quadrangles. CTW 2004: 71-74 - Domenico Cantone, Simone Faro:
Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm. CTW 2004: 75-80 - Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
Minimum Weighted Feedback Vertex Set on Diamonds. CTW 2004: 81-85 - William Y. C. Chen, Xueliang Li, Chao Wang, Xiaoyan Zhang:
Linear Time Algorithms to the Minimum All-Ones Problem for UniCyclic and Bicyclic Graphs. CTW 2004: 86-90 - Alessandro Chierici, Roberto Cordone, Roberto Maja:
The Demand-dependent Optimization of Regular Train Timetables. CTW 2004: 91-95 - Marie-Christine Costa, Alain Billionnet:
Multiway Cut and Integer Flow Problems in Trees. CTW 2004: 96-99 - Vladimir G. Deineko:
New Exponential Neighbourhood for Polynomially Solvable TSPs. CTW 2004: 100-103 - Paolo Detti, Carlo Meloni, Marco Pranzo:
Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs. CTW 2004: 104-108 - Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
On the Generation of Bicliques of a Graph. CTW 2004: 109-113 - Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
An Improved Discrepancy Approach to Declustering. CTW 2004: 114-118 - Takashi Doi, Toshihiro Fujito:
A Primal-Dual Method for Approximating Tree Cover with Two Weights. CTW 2004: 119-123 - Dries Van Dyck, Veerle Fack:
To be or not to be Yutsis. CTW 2004: 237-241 - M. Reza Emamy-Khansary:
The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic. CTW 2004: 124-126 - Ulrich Faigle, Bernhard Fuchs, Britta Wienand:
Covering Graphs by Colored Stable Sets. CTW 2004: 127-131 - Taoufik Faik:
About the b-Continuity of Graphs. CTW 2004: 132-136 - Fedor V. Fomin, Dimitrios M. Thilikos:
A 3-Approximation for the Pathwidth of Halin Graphs. CTW 2004: 137-141 - Jean-Luc Fouquet, Jean-Marie Vanherpe:
On (P5, P5)-Sparse Graphs and other Families. CTW 2004: 142-146
skipping 28 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-26 09:48 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