Остановите войну!
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 64 matches
- 2020
- Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev:
Letter graphs and geometric grid classes of permutations: Characterization and recognition. Discret. Appl. Math. 283: 482-494 (2020) - Luiz Emilio Allem, Fernando Tura:
Integral cographs. Discret. Appl. Math. 283: 153-167 (2020) - Ben Amiet, Greg Markowsky, José Luis Palacios:
On the equivalence of cylinder tilings and planar electric networks. Discret. Appl. Math. 283: 762-769 (2020) - Rommel M. Barbosa, Mitre Costa Dourado, Leila Roling Scariot da Silva:
Global defensive alliances in the lexicographic product of paths and cycles. Discret. Appl. Math. 283: 168-188 (2020) - Andreas Bärmann, Patrick Gemander, Maximilian Merkert:
The clique problem with multiple-choice constraints under a cycle-free dependency graph. Discret. Appl. Math. 283: 59-77 (2020) - Robert A. Beeler, Teresa W. Haynes, Michael A. Henning, Rodney Keaton:
Total domination cover rubbling. Discret. Appl. Math. 283: 133-141 (2020) - Sergey Bereg, Mohammadreza Haghpanah:
New lower bounds for Tverberg partitions with tolerance in the plane. Discret. Appl. Math. 283: 596-603 (2020) - Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Constant work-space algorithms for facility location problems. Discret. Appl. Math. 283: 456-472 (2020) - Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez:
Characterising circular-arc contact B0-VPG graphs. Discret. Appl. Math. 283: 435-443 (2020) - Peter Borg, Pawaton Kaemawichanurat:
Partial domination of maximal outerplanar graphs. Discret. Appl. Math. 283: 306-314 (2020) - Sabrina Bouchouika, Isma Bouchemakh, Éric Sopena:
Broadcasts on paths and cycles. Discret. Appl. Math. 283: 375-395 (2020) - Andreas Brandstädt, Raffaele Mosca:
Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time. Discret. Appl. Math. 283: 417-434 (2020) - Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu:
A connected version of the graph coloring game. Discret. Appl. Math. 283: 744-750 (2020) - Roberto Cruz, Juan Monsalve, Juan Rada:
Trees with maximum exponential Randić index. Discret. Appl. Math. 283: 634-643 (2020) - Bas J. Dietzenbacher, Peter Borm, Ruud Hendrickx:
A procedural egalitarian solution for NTU-games. Discret. Appl. Math. 283: 20-27 (2020) - Yoshimi Egawa, Mikio Kano, Maho Yokota:
Existence of all generalized fractional (g, f)-factors of graphs. Discret. Appl. Math. 283: 265-271 (2020) - Soogang Eoh, Suh-Ryung Kim, Hyesun Yoon:
On m-step competition graphs of bipartite tournaments. Discret. Appl. Math. 283: 199-206 (2020) - Yuanrui Feng, Douglas B. West, Yan Yang:
Upper bounds for bar visibility of subgraphs and n-vertex graphs. Discret. Appl. Math. 283: 272-274 (2020) - Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer:
On the structure of 4-regular planar well-covered graphs. Discret. Appl. Math. 283: 655-688 (2020) - Mareike Fischer, Andrew R. Francis:
How tree-based is my network? Proximity measures for unrooted phylogenetic networks. Discret. Appl. Math. 283: 98-114 (2020) - Jun Ge, Fengming Dong:
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs. Discret. Appl. Math. 283: 542-554 (2020) - Noam Goldberg, Gábor Rudolf:
On the complexity and approximation of the maximum expected value all-or-nothing subset. Discret. Appl. Math. 283: 1-10 (2020) - Ran Gu, Xueliang Li:
Conflict-free connection number of random graphs. Discret. Appl. Math. 283: 522-532 (2020) - Andreas D. M. Gunawan, Jeyaram Rathin, Louxin Zhang:
Counting and enumerating galled networks. Discret. Appl. Math. 283: 644-654 (2020) - Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler:
Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees. Discret. Appl. Math. 283: 495-511 (2020) - Christopher Hojny:
Packing, partitioning, and covering symresacks. Discret. Appl. Math. 283: 689-717 (2020) - Hongbo Hua, Xinying Hua, Hongzhuan Wang:
Further results on the Merrifield-Simmons index. Discret. Appl. Math. 283: 231-241 (2020) - Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283: 336-345 (2020) - Xiaojing Jiang, Weihua He, Qiang Liu, Jianping Li:
On the Kirchhoff index of bipartite graphs with given diameters. Discret. Appl. Math. 283: 512-521 (2020) - Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-branching problem in digraphs. Discret. Appl. Math. 283: 565-576 (2020)
skipping 34 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-05 20:36 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