Остановите войну!
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 61 matches
- 2021
- Bernardo M. Ábrego, Julia Dandurand, Silvia Fernández-Merchant:
The crossing number of centrally symmetric complete geometric graphs. LAGOS 2021: 275-279 - Javier T. Akagi, Eduardo A. Canale, Marcos Villagra:
Tromino Tilings with Pegs via Flow Networks. LAGOS 2021: 459-467 - Hessa Al-Thani, Jon Lee:
Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks. LAGOS 2021: 127-134 - Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies:
An Approximate Blow-up Lemma for Sparse Hypergraphs. LAGOS 2021: 394-403 - Matheus Diógenes Andrade, Fábio Luiz Usberti:
Combinatorial Properties for the Green Vehicle Routing Problem. LAGOS 2021: 478-488 - Jordan Barrett, Salomon Bendayan, Yanjia Li, Bruce A. Reed:
Partitioning Into Prescribed Number of Cycles and Mod k T-join With Slack. LAGOS 2021: 12-20 - Daniel Chicayban Bastos, Luis Antonio Brasil Kowada:
How to detect whether Shor's algorithm succeeds against large integers without a quantum computer. LAGOS 2021: 145-151 - Josefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen, Dionatan Ricardo Schmidt:
Maximum number of r-edge-colorings such that all copies of Kk are rainbow. LAGOS 2021: 419-426 - Henrique Becker, Olinto C. B. de Araújo, Luciana S. Buriol:
Extending an Integer Formulation for the Guillotine 2D Bin Packing Problem. LAGOS 2021: 499-507 - Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa:
An efficient parameterized approximation scheme for the Star k-Hub Center. LAGOS 2021: 49-58 - Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo K. K. Rosado:
On the Inapproximability of the Cable-Trench Problem. LAGOS 2021: 39-48 - Pierre Bergé, Michel Habib:
Diameter in linear time for constant-dimension median graphs. LAGOS 2021: 97-107 - Sören Berger, Simón Piga, Christian Reiher, Vojtech Rödl, Mathias Schacht:
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links. LAGOS 2021: 412-418 - Marcelo Bianchetti, Javier Marenco:
Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem. LAGOS 2021: 523-531 - Manuela Blaum, Javier Marenco:
Valid inequalities and complete characterizations of the 2-domination and the P3-hull number polytopes. LAGOS 2021: 532-542 - Lucas Böltz, Benjamin Becker, Hannes Frey:
Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence. LAGOS 2021: 108-117 - Flavia Bonomo-Braberman, Gastón Abel Brito:
Intersection models for 2-thin and proper 2-thin graphs. LAGOS 2021: 221-229 - Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota:
Counting orientations of graphs with no strongly connected tournaments. LAGOS 2021: 385-393 - Fábio Botler, Andrea Jiménez, Maycon Sambinelli, Yoshiko Wakabayashi:
The 2-Decomposition Conjecture for a new class of graphs. LAGOS 2021: 359-367 - Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan:
Cycle factors in randomly perturbed graphs. LAGOS 2021: 404-411 - Klairton Lima Brito, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Ulisses Dias, Zanoni Dias:
Reversal and Transposition Distance of Genomes Considering Flexible Intergenic Regions. LAGOS 2021: 21-29 - Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The Speed and Threshold of the Biased Perfect Matching Game. LAGOS 2021: 190-199 - Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The Speed and Threshold of the Biased Hamilton Cycle Game. LAGOS 2021: 200-211 - Márcia R. Cappelle, Guilherme C. M. Gomes, Vinícius Fernandes dos Santos:
Parameterized algorithms for locating-dominating sets. LAGOS 2021: 68-76 - Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon:
Bounds on the Diameter of Graph Associahedra. LAGOS 2021: 239-247 - Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon:
On total coloring the direct product of complete graphs. LAGOS 2021: 306-314 - Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic:
Graphs with Two Moplexes. LAGOS 2021: 248-256 - Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle:
Treelength of Series-parallel Graphs. LAGOS 2021: 30-38 - Laura Eslava, Sarah Penington, Fiona Skerman:
Survival for a Galton-Watson tree with cousin mergers. LAGOS 2021: 445-452 - Luérbio Faria, André Luiz Pires Guedes, Lilian Markenzon:
On feedback vertex set in reducible flow hypergraphs. LAGOS 2021: 212-220
skipping 31 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-06-03 21:47 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