Остановите войну!
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 75 matches
- 2018
- Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman:
On the m-clique free interval subgraphs polytope: polyhedral analysis and applications. J. Comb. Optim. 36(3): 1074-1101 (2018) - Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. 36(4): 1221-1242 (2018) - Jafar Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
An upper bound on the double Roman domination number. J. Comb. Optim. 36(1): 81-89 (2018) - Kazutoshi Ando, Koki Sato:
An algorithm for finding a representation of a subtree distance. J. Comb. Optim. 36(3): 742-762 (2018) - Pawan Aurora, Monalisa Jena, Rajiv Raman:
Constant factor approximation for the weighted partial degree bounded edge packing problem. J. Comb. Optim. 36(4): 1243-1261 (2018) - Pawan Aurora, Shashank K. Mehta:
The QAP-polytope and the graph isomorphism problem. J. Comb. Optim. 36(3): 965-1006 (2018) - Walid Ben-Ameur, Antoine Glorieux, José Neto:
On the most imbalanced orientation of a graph. J. Comb. Optim. 36(2): 637-669 (2018) - Fatiha Bendali, Jean Mailfert:
The weakly connected independent set polytope in corona and join of graphs. J. Comb. Optim. 36(3): 1007-1023 (2018) - Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner:
The min-up/min-down unit commitment polytope. J. Comb. Optim. 36(3): 1024-1058 (2018) - Sergey Bereg, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Mario Alberto López:
Computing the k-resilience of a synchronized multi-robot system. J. Comb. Optim. 36(2): 365-391 (2018) - Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau:
Approximability and exact resolution of the multidimensional binary vector assignment problem. J. Comb. Optim. 36(3): 1059-1073 (2018) - Maurizio Bruglieri, Ferdinando Pezzella, Ornella Pisacane:
A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems. J. Comb. Optim. 36(1): 162-193 (2018) - Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan:
On approximating optimal weight "no"-certificates in weighted difference constraint systems. J. Comb. Optim. 36(2): 329-345 (2018) - Xing Chai, Wenhua Li:
Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan. J. Comb. Optim. 36(2): 472-492 (2018) - Hong Chang, Xueliang Li, Colton Magnant, Zhongmei Qin:
The (k , ℓ)-proper index of graphs. J. Comb. Optim. 36(2): 458-471 (2018) - Lina Chen, Xiaohui Huang, Zhao Zhang:
A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network. J. Comb. Optim. 36(1): 35-43 (2018) - Stefano Coniglio, Arie M. C. A. Koster, Nils Spiekermann:
Lot sizing with storage losses under demand uncertainty. J. Comb. Optim. 36(3): 763-788 (2018) - Oliver G. Czibula, Hanyu Gu, Yakov Zinder:
Planning personnel retraining: column generation heuristics. J. Comb. Optim. 36(3): 896-915 (2018) - Wei Ding, Ke Qiu:
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees. J. Comb. Optim. 36(4): 1262-1298 (2018) - Riccardo Dondi, Florian Sikora:
Finding disjoint paths on edge-colored graphs: more tractability results. J. Comb. Optim. 36(4): 1315-1332 (2018) - Leah Epstein, David S. Johnson, Asaf Levin:
Min-Sum Bin Packing. J. Comb. Optim. 36(2): 508-531 (2018) - Qizhi Fang, Bo Li, Xiaohan Shan, Xiaoming Sun:
Path cooperative games. J. Comb. Optim. 36(1): 211-229 (2018) - Matthias Feldotto, Lennart Leder, Alexander Skopalik:
Congestion games with mixed objectives. J. Comb. Optim. 36(4): 1145-1167 (2018) - Xin Feng, Yinfeng Xu, Guanqun Ni, Yongwu Dai:
Online leasing problem with price fluctuations under the consumer price index. J. Comb. Optim. 36(2): 493-507 (2018) - Wai Lam Fong, Wai Hong Chan, Ge Nong:
The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices. J. Comb. Optim. 36(1): 1-12 (2018) - Ling Gai, Hongwei Du, Lidong Wu, Junlei Zhu, Yuehua Bu:
Blocking Rumor by Cut. J. Comb. Optim. 36(2): 392-399 (2018) - Corinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz:
Optimization problems with color-induced budget constraints. J. Comb. Optim. 36(3): 861-870 (2018) - Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Subset sum problems with digraph constraints. J. Comb. Optim. 36(3): 937-964 (2018) - Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Broadcasting multiple messages in the 1-in port model in optimal time. J. Comb. Optim. 36(4): 1333-1355 (2018) - Jinwei Gu, Manzhan Gu, Xiwen Lu, Ying Zhang:
Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan. J. Comb. Optim. 36(1): 142-161 (2018)
skipping 45 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 23:18 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