Остановите войну!
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 28 matches
- 2019
- I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin:
Minimum cost noncrossing flow problem on layered networks. Discret. Appl. Math. 261: 2-21 (2019) - Claudio Arbib, Oya Ekin Karasan, Mustafa Ç. Pinar:
On envy-free perfect matching. Discret. Appl. Math. 261: 22-27 (2019) - Anna Arigliano, Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero, Isaac Plana:
Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm. Discret. Appl. Math. 261: 28-39 (2019) - Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. Discret. Appl. Math. 261: 40-51 (2019) - Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Flávio Keidi Miyazawa, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Dijkstra graphs. Discret. Appl. Math. 261: 52-62 (2019) - Luca Bertazzi, Bruce L. Golden, Xingyin Wang:
The Bin Packing Problem with Item Fragmentation: A worst-case analysis. Discret. Appl. Math. 261: 63-77 (2019) - Flavia Bonomo, Diego de Estrada:
On the thinness and proper thinness of a graph. Discret. Appl. Math. 261: 78-92 (2019) - Marin Bougeret, Artur Alves Pessoa, Michael Poss:
Robust scheduling with budgeted uncertainty. Discret. Appl. Math. 261: 93-107 (2019) - Richard C. Brewster, Gary MacGillivray, Feiran Yang:
Broadcast domination and multipacking in strongly chordal graphs. Discret. Appl. Math. 261: 108-118 (2019) - Kathie Cameron, Chính T. Hoàng:
Solving the clique cover problem on (bull, C4)-free graphs. Discret. Appl. Math. 261: 119-122 (2019) - Yves Crama, Bernard Gendron, Bernard Ries:
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016. Discret. Appl. Math. 261: 1 (2019) - Zakir Deniz, Tínaz Ekim:
Edge-stable equimatchable graphs. Discret. Appl. Math. 261: 136-147 (2019) - Andreas T. Ernst, Joey Fung, Gaurav Singh, Yakov Zinder:
Flexible flow shop with dedicated buffers. Discret. Appl. Math. 261: 148-163 (2019) - Rosa Figueiredo, Yuri Frota, Martine Labbé:
A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph. Discret. Appl. Math. 261: 164-185 (2019) - Hanna Furmanczyk, Pawel Obszarski:
Equitable coloring of hypergraphs. Discret. Appl. Math. 261: 186-192 (2019) - Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier:
Timber game as a counting problem. Discret. Appl. Math. 261: 193-202 (2019) - Bernard Gendron:
Revisiting Lagrangian relaxation for network design. Discret. Appl. Math. 261: 203-218 (2019) - Pavol Hell, César Hernández-Cruz, Cláudia Linhares Sales:
Minimal obstructions to 2-polar cographs. Discret. Appl. Math. 261: 219-228 (2019) - Alain Hertz, Romain Montagné, François Gagnon:
A comparison of integer programming models for the partial directed weighted improper coloring problem. Discret. Appl. Math. 261: 229-245 (2019) - Jing Huang, Josh Manzer:
Chronological rectangle digraphs which are two-terminal series-parallel. Discret. Appl. Math. 261: 246-257 (2019) - Marcin Kaminski, Anna Pstrucha:
Certifying coloring algorithms for graphs without long induced paths. Discret. Appl. Math. 261: 258-267 (2019) - Samia Kerdjoudj, André Raspaud:
List star edge-coloring of k-degenerate graphs and K4-minor free graphs. Discret. Appl. Math. 261: 268-275 (2019) - Martine Labbé, Luisa I. Martínez-Merino, Antonio M. Rodríguez-Chía:
Mixed integer linear programming for feature selection in support vector machine. Discret. Appl. Math. 261: 276-304 (2019) - Robert Lewon, Anna Malafiejska, Michal Malafiejski, Kacper Wereszko:
Global edge alliances in graphs. Discret. Appl. Math. 261: 305-315 (2019) - Marcio Costa Santos, Hannan Luss, Dritan Nace, Michael Poss:
Proportional and maxmin fairness for the sensor location problem with chance constraints. Discret. Appl. Math. 261: 316-331 (2019) - Anderson G. da Silva, Simone Dantas, Diana Sasaki:
Equitable total coloring of complete r-partite p-balanced graphs. Discret. Appl. Math. 261: 123-135 (2019) - Alan J. Soper, Vitaly A. Strusevich:
Schedules with a single preemption on uniform parallel machines. Discret. Appl. Math. 261: 332-343 (2019) - Simon Thevenin, Nicolas Zufferey:
Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections. Discret. Appl. Math. 261: 344-353 (2019)
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-11 12:28 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