Остановите войну!
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 54 matches
- 2013
- Kamiel Cornelissen, Ruben Hoeksma, Johann L. Hurink, Bodo Manthey:
12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013. CTIT Workshop Proceedings WP 13-01, 2013 [contents] - Nair Maria Maia de Abreu, Maria Aguieiras A. de Freitas, Renata R. Del-Vecchio:
Simultaneously integral graphs on three associated matrices. CTW 2013: 7-10 - Stephan Dominique Andres, Winfried Hochstättler:
Perfect digraphs and a strong perfect digraph theorem. CTW 2013: 11-13 - Danilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
Geodetic sets and periphery. CTW 2013: 15-18 - Damián Bakarcic, Gabriela Di Piazza, Isabel Méndez-Díaz, Paula Zabala:
An IP based heuristic algorithm for the vehicle and crew scheduling pick-up and delivery problem with time windows. CTW 2013: 19-22 - Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan:
Online checkpointing with improved worst-case guarantees. CTW 2013: 23-26 - Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed analysis of the successive shortest path algorithm. CTW 2013: 27-30 - Christoph Buchheim, Laura Klein:
The spanning tree problem with one quadratic term. CTW 2013: 31-34 - Christina Büsing, Fabio D'Andreagiovanni, Annie Raymond:
Robust optimization under multiband uncertainty. CTW 2013: 35-38 - Eglantine Camby, Oliver Schaudt:
Connected dominating set in graphs without long paths and cycles. CTW 2013: 39-42 - Márcia R. Cerioli, Daniel F. D. Posner:
Total L(2, 1)-coloring of graphs. CTW 2013: 43-46 - Sourav Chakraborty, Akshay Kamath, Rameshwar Pratap:
Testing uniformity of stationary distribution. CTW 2013: 47-50 - Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit:
Balanced Abelian group valued functions on directed graphs: Extended abstract. CTW 2013: 51-54 - Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
An oriented 8-coloring for acyclic oriented graphs with maximum degree 3. CTW 2013: 55-58 - Stefano Coniglio:
Bound-optimal cutting planes. CTW 2013: 59-62 - Fernanda Couto, Luérbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
On specifying boundary conditions for the graph sandwich problem. CTW 2013: 63-66 - Jean-François Couturier, Mathieu Liedloff:
A tight bound on the number of minimal dominating sets in split graph. CTW 2013: 67-70 - Radu Curticapean, Marvin Künnemann:
A quantization framework for smoothed analysis on Euclidean optimization problems. CTW 2013: 71-74 - Elias Dahlhaus:
Linear time and almost linear time cases for minimal elimination orderings. CTW 2013: 75-78 - Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki:
On total coloring and equitable total coloring of cubic graphs with large girth. CTW 2013: 79-83 - Ekrem Duman, Ahmet Altun:
Routing ATM loading vehicles. CTW 2013: 85-88 - Michael Etscheid:
Performance guarantees for scheduling algorithms under perturbed machine speeds. CTW 2013: 89-92 - Ulrich Faigle, Alexander Schönhuth:
Observation and evolution of finite-dimensional Markov systems. CTW 2013: 93-97 - Philipp von Falkenhausen, Tobias Harks:
Optimal cost sharing for capacitated facility location games. CTW 2013: 99-102 - Mirjam Friesen, Dirk Oliver Theis:
Fooling-sets and rank in nonzero characteristic. CTW 2013: 107-111 - Giulia Galbiati, Stefano Gualandi:
Coloring of paths into forests. CTW 2013: 113-116 - Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos:
A linear kernel for planar red-blue dominating set. CTW 2013: 117-120 - Ruben Hoeksma, Marc Uetz:
Two-dimensional optimal mechanism design for a single machine scheduling problem. CTW 2013: 125-127 - Olivier Hudry:
Application of the descent with mutations (DWM) metaheuristic to the computation of a median equivalence relation. CTW 2013: 129-132 - Ayumi Igarashi, Yoshitsugu Yamamoto:
Computational complexity of the average covering tree value. CTW 2013: 223-226
skipping 24 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-07-10 22:11 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