Остановите войну!
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
- 2023
- Eric Aaron, Úrsula Hébert-Johnson, Danny Krizanc, Daniel Lokshtanov:
Min-max coverage problems on tree-like metrics. LAGOS 2023: 148-156 - Aida Abiad, Anuj Dawar, Octavio Zapata:
Descriptive complexity of controllable graphs. LAGOS 2023: 20-27 - Flor Aguilar-Campos, Gabriela Araujo-Pardo, Leah Berman:
Voltage graphs as a technique to obtaining semi-cubic cages (Brief Announcement). LAGOS 2023: 406-408 - T. Ahmed, Luis Boza, M. P. Revuelta, María Isabel Sanz Domínguez:
Lower bounds and exact values of the 2-color off-diagonal generalized weak Schur numbers WS(2;k1, k2) (Brief Announcement). LAGOS 2023: 403-405 - Alonso Ali, Orlando Lee:
Five edge-independent spanning trees. LAGOS 2023: 223-230 - José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota:
A canonical Ramsey theorem with list constraints in random graphs. LAGOS 2023: 13-19 - José D. Alvarado, Yoshiharu Kohayakawa, Richard Lang, Guilherme Oliveira Mota, Henrique Stagni:
Resilience for loose Hamilton cycles. LAGOS 2023: 193-200 - Gabriela Araujo-Pardo, Martín Matamala, J. Zamora:
A de Bruijn and Erdös property in quasi-metric spaces with four points. LAGOS 2023: 308-315 - Gabriela Araujo-Pardo, Martín Matamala, José Zamora:
Counting lines in semi-complete digraphs *. LAGOS 2023: 352-359 - Samuel N. Araújo, Raquel Folz, Rosiane de Freitas, Rudini Sampaio:
Complexity and winning strategies of graph convexity games (Brief Announcement). LAGOS 2023: 394-396 - J. Araujo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan:
Semi-proper orientations of dense graphs. LAGOS 2023: 231-240 - J. Araújo, Ana Karolinna Maia, P. P. Medeiros, Lucia Draque Penso:
On the hull and interval numbers of oriented graphs (Brief Announcement). LAGOS 2023: 397-399 - Esther M. Arkin, Rezaul Alam Chowdhury, Mayank Goswami, Jason Huang, Joseph S. B. Mitchell, Valentin Polishchuk, Rakesh Ravindran:
Fair subgraph selection for contagion containment (Brief Announcement). LAGOS 2023: 370-372 - Stephen Arndt, Josh Ascher, Kirk Pruhs:
Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem. LAGOS 2023: 121-129 - Oliver Bachtler, Irene Heinrich:
Reductions for the 3-Decomposition Conjecture. LAGOS 2023: 96-103 - József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro:
Crossing numbers of complete bipartite graphs. LAGOS 2023: 78-87 - Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret Wagler:
A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement). LAGOS 2023: 391-393 - Fábio Botler, Wanderson Lomenha, João Pedro de Souza:
On nonrepetitive colorings of cycles. LAGOS 2023: 302-307 - Laurent Bulteau, Pierre-Yves David, Florian Horn:
The Problem of Discovery in Version Control Systems. LAGOS 2023: 209-216 - Lucía Busolini, Guillermo Durán, Martín D. Safe:
Characterization of balanced graphs within claw-free graphs. LAGOS 2023: 258-266 - Yair Caro, Ileana González-Escalante, Adriana Hansberg, Mariel Jácome, Tonatiuh Matos Wiederhold, Amanda Montejano:
Graphs with constant balancing number. LAGOS 2023: 325-333 - Jorge Cervantes-Ojeda, Juan Carlos García-Altamirano, Mika Olsen:
Computacional complexity of Hajós constructions of symmetric odd cycles. LAGOS 2023: 112-120 - Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä:
Identifying codes in bipartite graphs of given maximum degree. LAGOS 2023: 157-165 - Markus Chimani, Niklas Troost, Tilo Wiedera:
A general approximation for multistage subgraph problems. LAGOS 2023: 334-342 - Serafino Cicerone, Gabriele Di Stefano:
Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. LAGOS 2023: 104-111 - Erika Morais Martins Coelho, H. Coelho, L. Faria, M. P. Ferreira, S. Klein:
On the absolute and relative oriented clique problems' time complexity. LAGOS 2023: 275-282 - Erika M. M. Coelho, Hebert Coelho, Braully Rocha:
P3-Carathéodory number on graphs with diameter two (Brief Announcement). LAGOS 2023: 388-390 - Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Polarity on H-split graphs. LAGOS 2023: 184-192 - Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Simple certifying algorithms for variants of the (2, 1)-colouring problem. LAGOS 2023: 292-301 - Isac Costa, Carlos V. G. C. Lima, Thiago Marcilon:
The Conversion Set Problem on Graphs. LAGOS 2023: 175-183
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-05-09 19:13 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