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 40 matches
- 2024
- Mariia Anapolska, Tabea Brandt, Christina Büsing, Tobias Mömke:
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms. Discret. Appl. Math. 358: 230-253 (2024) - Dorde Baralic, Jelena Ivanovic, Zoran Petric:
Chromatic numbers for facet colouring of some generalised associahedra. Discret. Appl. Math. 358: 272-284 (2024) - Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
On locally identifying coloring of Cartesian product and tensor product of graphs. Discret. Appl. Math. 358: 429-447 (2024) - Endre Boros, Kazuhisa Makino:
Generating minimal redundant and maximal irredundant subhypergraphs. Discret. Appl. Math. 358: 217-229 (2024) - Boris Brimkov, Valentin E. Brimkov:
Graphs with degree sequence {(m-1)m,(n-1)n} and {mn,nm}. Discret. Appl. Math. 358: 477-486 (2024) - Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
On locating and neighbor-locating colorings of sparse graphs. Discret. Appl. Math. 358: 366-381 (2024) - Fei-Huang Chang, Wei-Tian Li, Daphne Der-Fen Liu, Zhishi Pan:
On k-shifted antimagic spider forests. Discret. Appl. Math. 358: 468-476 (2024) - Xiaodan Chen, Shuting Zhang:
On spectral radius of generalized arithmetic-geometric matrix of connected graphs and its applications. Discret. Appl. Math. 358: 1-12 (2024) - Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický:
Relaxation of Wegner's planar graph conjecture for maximum degree 4. Discret. Appl. Math. 358: 254-261 (2024) - Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility in strong products of graphs via total mutual-visibility. Discret. Appl. Math. 358: 136-146 (2024) - Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni:
On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. Discret. Appl. Math. 358: 417-428 (2024) - Paolo Dulio, Andrea Frosini:
Integer orbits in rectangular lattice billiards. Discret. Appl. Math. 358: 302-319 (2024) - Vladimir Gurvich, Mariya Naumova:
Screw discrete dynamical systems and their applications to exact slow NIM. Discret. Appl. Math. 358: 382-394 (2024) - Teresa W. Haynes, Michael A. Henning:
A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set. Discret. Appl. Math. 358: 457-467 (2024) - Shunhai He, Huiqing Liu:
On the rainbow planar Turán number of double stars. Discret. Appl. Math. 358: 167-175 (2024) - Michael A. Henning, Shahin N. Jogan:
A characterization of graphs with given total coalition numbers. Discret. Appl. Math. 358: 395-403 (2024) - Hongbo Hua, Hechao Liu:
Some results on vulnerability parameters and Wiener-type indices. Discret. Appl. Math. 358: 262-271 (2024) - Ji-Hwan Jung, Suh-Ryung Kim, Hyesun Yoon:
A complete analysis of the convergence of Cm(D)m=1∞ for a multipartite tournament D. Discret. Appl. Math. 358: 344-357 (2024) - Alexander V. Karzanov:
On stable assignments generated by choice functions of mixed type. Discret. Appl. Math. 358: 112-135 (2024) - Tom Kelly, Luke Postle:
Improving the Caro-Wei bound and applications to Turán stability. Discret. Appl. Math. 358: 33-43 (2024) - Shmuel T. Klein, Elina Opalinsky, Dana Shapira:
Selective dynamic compression. Discret. Appl. Math. 358: 13-22 (2024) - Shmuel T. Klein, Elina Opalinsky, Dana Shapira:
Synchronizing dynamic Huffman codes. Discret. Appl. Math. 358: 23-32 (2024) - Martin Kreh:
Pagoda functions for peg solitaire on graphs. Discret. Appl. Math. 358: 184-202 (2024) - Danyi Li, Xing Feng, Weigen Yan:
Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip. Discret. Appl. Math. 358: 320-325 (2024) - Luyang Li, Xinchuan Huang, Qinglan Zhao, Dong Zheng:
Two classes of 1-resilient semi-bent functions based on disjoint linear codes. Discret. Appl. Math. 358: 147-157 (2024) - Zhengjiao Liu, Tao Wang, Xiaojing Yang:
Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles. Discret. Appl. Math. 358: 158-166 (2024) - Yingbin Ma, Mingli Wang, Wei Zhao, Kairui Nie:
Some results on (strong) total proper connection number of some digraphs. Discret. Appl. Math. 358: 44-56 (2024) - Subhabrata Paul, Kamal Santra:
Algorithmic study on 2-transitivity of graphs. Discret. Appl. Math. 358: 57-75 (2024) - M. Alfred Raju, P. Venkata Subba Reddy, Ismael G. Yero:
On the total version of the covering Italian domination problem. Discret. Appl. Math. 358: 333-343 (2024) - Eshwar Srinivasan, Ramesh Hariharasubramanian:
Minimum length word-representants of graph products. Discret. Appl. Math. 358: 91-104 (2024)
skipping 10 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-09-17 11:51 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