Остановите войну!
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 26 matches
- 2022
- Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
Total tessellation cover: Bounds, hardness, and applications. Discret. Appl. Math. 323: 149-161 (2022) - Rafael Castro de Andrade, Tibérius de Oliveira e Bonates, Manoel B. Campêlo, Mardson da Silva Ferreira:
A compact quadratic model and linearizations for the minimum linear arrangement problem. Discret. Appl. Math. 323: 134-148 (2022) - Júlio Araújo, P. S. M. Arraes:
Hull and geodetic numbers for some classes of oriented graphs. Discret. Appl. Math. 323: 14-27 (2022) - Camila S. Araújo, Júlio Araújo, Ana Silva, Alexandre A. Cezar:
Backbone coloring of graphs with galaxy backbones. Discret. Appl. Math. 323: 2-13 (2022) - Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Guilherme Oliveira Mota, Olaf Parczyk:
Anti-Ramsey threshold of cycles. Discret. Appl. Math. 323: 228-235 (2022) - Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse:
Metric dimension: From graphs to oriented graphs. Discret. Appl. Math. 323: 28-42 (2022) - Flavia Bonomo-Braberman, Guillermo Durán, Nina Pardal, Martín D. Safe:
Forbidden induced subgraph characterization of circle graphs within split graphs. Discret. Appl. Math. 323: 43-75 (2022) - Flavia Bonomo-Braberman, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Precedence thinness in graphs. Discret. Appl. Math. 323: 76-95 (2022) - Mónica Braga, Javier Marenco:
Facet-generating procedures for the maximum-impact coloring polytope. Discret. Appl. Math. 323: 96-112 (2022) - André Ebling Brondani, Francisca Andrea Macedo França, Carla Silva Oliveira:
Positive semidefiniteness of Aα(G) on some families of graphs. Discret. Appl. Math. 323: 113-123 (2022) - Márcia R. Cappelle, Erika M. M. Coelho, Les R. Foulds, Humberto J. Longo:
Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs. Discret. Appl. Math. 323: 124-133 (2022) - Pablo De Caria:
Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs. Discret. Appl. Math. 323: 171-183 (2022) - Yingjun Dai, Angèle M. Foley, Chính T. Hoàng:
On coloring a class of claw-free and hole-twin-free graphs. Discret. Appl. Math. 323: 162-170 (2022) - Cristina G. Fernandes, Carla Negri Lintzmayer:
Leafy spanning arborescences in DAGs. Discret. Appl. Math. 323: 217-227 (2022) - Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Diana Sasaki, Ana Silva:
Revising Johnson's table for the 21st century. Discret. Appl. Math. 323: 184-200 (2022) - Mathew C. Francis, Lívia Salgado Medeiros, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
On subclasses of interval count two and on Fishburn's conjecture. Discret. Appl. Math. 323: 236-251 (2022) - Marina Groshaus, André Luiz Pires Guedes, Juan Pablo Puppo:
Biclique graphs of split graphs. Discret. Appl. Math. 323: 252-267 (2022) - Carlos Hoppen, Giovane Mansan:
Minimum 2-dominating sets in regular graphs. Discret. Appl. Math. 323: 268-285 (2022) - Ivo Koch, Javier Marenco:
The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations. Discret. Appl. Math. 323: 286-301 (2022) - Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
Percolation centrality via Rademacher Complexity. Discret. Appl. Math. 323: 201-216 (2022) - Leandro Montero:
Vertex removal in biclique graphs. Discret. Appl. Math. 323: 302-310 (2022) - Aleffer Rocha, Sheila Morais de Almeida, Leandro M. Zatesko:
Rainbow connectivity and rainbow criticality on graph classes. Discret. Appl. Math. 323: 311-323 (2022) - Vinícius Fernandes dos Santos, Sebastián Urrutia:
Preface: LAGOS'19 - X Latin and American Algorithms, Graphs, and Optimization Symposium - Belo Horizonte, Minas Gerais, Brazil. Discret. Appl. Math. 323: 1 (2022) - Robert Scheffler:
The Distance Orientation Problem. Discret. Appl. Math. 323: 324-342 (2022) - Sizhong Zhou:
A neighborhood union condition for fractional (a, b, k)-critical covered graphs. Discret. Appl. Math. 323: 343-348 (2022) - Alesom Zorzi, Celina M. H. de Figueiredo, Raphael C. S. Machado, Leandro M. Zatesko, Uéverton S. Souza:
Compositions, decompositions, and conformability for total coloring on power of cycle graphs. Discret. Appl. Math. 323: 349-363 (2022)
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-25 08:55 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