Остановите войну!
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 77 matches
- 2015
- Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan:
Minimum Size Tree-decompositions. Electron. Notes Discret. Math. 50: 21-27 (2015) - Fabio Henrique N. Abe, Edna Ayako Hoshino, Alessandro Hill:
The Ring Tree Facility Location Problem. Electron. Notes Discret. Math. 50: 331-336 (2015) - Pierre Aboulker, Zhentao Li, Stéphan Thomassé:
Excluding clocks. Electron. Notes Discret. Math. 50: 103-108 (2015) - Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon:
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Electron. Notes Discret. Math. 50: 249-254 (2015) - Liliana Alcón, Noemí Gudiño, Marisa Gutierrez:
On containment graphs of paths in a tree. Electron. Notes Discret. Math. 50: 175-180 (2015) - Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert:
Pebbling in 2-Paths. Electron. Notes Discret. Math. 50: 145-150 (2015) - Jorge Alencar, Tibérius O. Bonates, Carlile Lavor, Leo Liberti:
An algorithm for realizing Euclidean distance matrices. Electron. Notes Discret. Math. 50: 397-402 (2015) - Carlos A. Alfaro, Carlos E. Valencia:
Graphs with few trivial critical ideals. Electron. Notes Discret. Math. 50: 391-396 (2015) - Tetsuya Araki, Norie Fu:
On Rotational Symmetries of Drawings of Coherent Periodic Graphs. Electron. Notes Discret. Math. 50: 373-378 (2015) - Júlio Araújo, Frédéric Havet, Mathieu Schmitt:
Steinberg-like theorems for backbone colouring. Electron. Notes Discret. Math. 50: 223-229 (2015) - Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Katrin Wagler:
A polyhedral approach to locating-dominating sets in graphs. Electron. Notes Discret. Math. 50: 89-94 (2015) - Danilo Artigas, R. Sritharan:
Geodeticity of the contour of chordal bipartite graphs. Electron. Notes Discret. Math. 50: 237-242 (2015) - Omid Atabati, Babak Farzad:
A hierarchical network formation model. Electron. Notes Discret. Math. 50: 379-384 (2015) - Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Ana Silva:
Complexity of determining the maximum infection time in the geodetic convexity. Electron. Notes Discret. Math. 50: 403-408 (2015) - Marco Blanco, Ralf Borndörfer, Michael Brückner, Nam-Dung Hoang, Thomas Schlechte:
On the Path Avoiding Forbidden Pairs Polytope. Electron. Notes Discret. Math. 50: 343-348 (2015) - Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon:
k-tuple chromatic number of the cartesian product of graphs. Electron. Notes Discret. Math. 50: 243-248 (2015) - Fábio Botler, Andrea Jiménez:
On path decompositions of 2k-regular graphs. Electron. Notes Discret. Math. 50: 163-168 (2015) - Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi:
Decompositions of highly connected graphs into paths of length five. Electron. Notes Discret. Math. 50: 211-216 (2015) - Sylvia C. Boyd, Philippe Legault:
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem. Electron. Notes Discret. Math. 50: 427-432 (2015) - Samuel Souza Brito, Haroldo Gambini Santos, Marcus Poggi:
A Computational Study of Conflict Graphs and Aggressive Cut Separation in Integer Programming. Electron. Notes Discret. Math. 50: 355-360 (2015) - Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri:
Computing an Evolutionary Ordering is Hard. Electron. Notes Discret. Math. 50: 255-260 (2015) - José Cáceres, María Luz Puertas, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
Quasiperfect Domination in Trees. Electron. Notes Discret. Math. 50: 439-444 (2015) - Manoel B. Campêlo, Ricardo C. Corrêa, Cláudia Linhares Sales, Rudini M. Sampaio:
Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium. Electron. Notes Discret. Math. 50: 1-2 (2015) - Victor A. Campos, Raul Lopes:
A Proof for a Conjecture of Gorgol. Electron. Notes Discret. Math. 50: 367-372 (2015) - Eduardo A. Canale, Claudio E. Risso:
Optimal Edge Fault-Tolerant Bijective Embedding of a Complete Graph over a Cycle. Electron. Notes Discret. Math. 50: 217-222 (2015) - Pablo De Caria, Miguel A. Pizaña:
On second iterated clique graphs that are also third iterated clique graphs. Electron. Notes Discret. Math. 50: 319-324 (2015) - André Breda Carneiro, Cândida Nunes da Silva, Brendan D. McKay:
A Faster Test for 4-Flow-Criticality in Snarks. Electron. Notes Discret. Math. 50: 193-198 (2015) - L. Elisa Celis, Filip Pavetic, Brunella Spinelli, Patrick Thiran:
Budgeted sensor placement for source localization on trees. Electron. Notes Discret. Math. 50: 65-70 (2015) - Jonathan Chappelon, Luis Pedro Montejano, Jorge L. Ramírez Alfonsín, Leonardo Martínez-Sandoval, Luis Montejano:
Kneser Transversals. Electron. Notes Discret. Math. 50: 385-390 (2015) - Rafael S. Coelho, Phablo F. S. Moura, Yoshiko Wakabayashi:
The k-hop connected dominating set problem: hardness and polyhedra. Electron. Notes Discret. Math. 50: 59-64 (2015)
skipping 47 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-05-23 23: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