Остановите войну!
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 1,026 matches
- 2024
- Rikuya Sasaki, Hiroyuki Ichida, Htoo Htoo Sandi Kyaw, Keiichi Kaneko:
Node-to-Set Disjoint Paths Problem in Cross-Cubes. IEICE Trans. Inf. Syst. 107(1): 53-59 (2024) - Mengjie Lv, Jianxi Fan, Baolei Cheng, Jia Yu, Xiaojua Jia:
Construction algorithms of fault-tolerant paths and disjoint paths in k-ary n-cube networks. J. Parallel Distributed Comput. 183: 104761 (2024) - Oliver Bachtler, Tim Bergner, Sven O. Krumke:
Almost disjoint paths and separating by forbidden pairs. Theor. Comput. Sci. 982: 114272 (2024) - Tomás Dvorák, Mei-Mei Gu:
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements. Theor. Comput. Sci. 986: 114327 (2024) - Ildikó Schlotter:
Shortest Two Disjoint Paths in Conservative Graphs. STACS 2024: 57:1-57:17 - Dario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Edge-Disjoint Paths in Eulerian Digraphs. CoRR abs/2402.13716 (2024) - Matthias Bentert, Fedor V. Fomin, Petr A. Golovach:
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. CoRR abs/2402.15348 (2024) - 2023
- Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi Agent Syst. 37(1): 1 (2023) - Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Algorithmica 85(9): 2580-2604 (2023) - Yujia He, Shurong Zhang, Lin Chen, Weihua Yang:
The disjoint path cover in the data center network HSDC with prescribed vertices in each path. Appl. Math. Comput. 459: 128262 (2023) - Eminjan Sabir, Jixiang Meng:
Degree sequence conditions for a graph to be disjoint path coverable. Discret. Appl. Math. 332: 62-69 (2023) - Ansong Ma, Yuefang Sun, Xiaoyan Zhang:
A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs. Discret. Math. 346(8): 113401 (2023) - Jung-Heum Park:
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults. Int. J. Found. Comput. Sci. 34(4): 429-441 (2023) - José M. F. Craveirinha, Marta Pascoal, João C. N. Clímaco:
An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks. INFOR Inf. Syst. Oper. Res. 61(3): 399-418 (2023) - Meijie Ma, Chaoming Guo, Xiang-Jun Li:
Disjoint paths in the enhanced hypercube with a faulty subgraph. J. Appl. Math. Comput. 69(2): 1343-1354 (2023) - Guyslain Naves, F. Bruce Shepherd, Henry Xia:
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. Math. Program. 197(2): 1049-1067 (2023) - Marco A. Ribeiro, Iago Augusto de Carvalho, Armando Honorio Pereira:
The widest k-set of disjoint paths problem. RAIRO Oper. Res. 57(1): 87-97 (2023) - Satoru Iwata, Yu Yokoi:
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals. SIAM J. Comput. 52(5): 1230-1268 (2023) - Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths. SIAM J. Discret. Math. 37(3): 1674-1703 (2023) - Rajesh Chitnis:
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. SIAM J. Discret. Math. 37(2): 556-572 (2023) - Weibei Fan, Fu Xiao, Hui Cai, Xiaobai Chen, Shui Yu:
Disjoint Paths Construction and Fault-Tolerant Routing in BCube of Data Center Networks. IEEE Trans. Computers 72(9): 2467-2481 (2023) - Hongxi Liu, Mingzu Zhang, Xiaowei Xu:
Many-to-many edge-disjoint paths in (n,k)-enhanced hypercube under three link-faulty hypotheses. Theor. Comput. Sci. 957: 113855 (2023) - Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Few induced disjoint paths for H-free graphs. Theor. Comput. Sci. 939: 182-193 (2023) - Jung-Heum Park, Hyeong-Seok Lim:
Characterization of interval graphs that are paired 2-disjoint path coverable. J. Supercomput. 79(3): 2783-2800 (2023) - Binglin Tao, Mingyu Xiao, Jingyang Zhao:
Minimum-Weight Link-Disjoint Paths With a Bounded Number of Shared Nodes. IEEE Trans. Netw. Serv. Manag. 20(3): 2598-2610 (2023) - Balázs Vass, Erika R. Bérczi-Kovács, Ábel Barabás, Zsombor L. Hajdú, János Tapolcai:
A Whirling Dervish: Polynomial-Time Algorithm for the Regional SRLG-Disjoint Paths Problem. IEEE/ACM Trans. Netw. 31(6): 3051-3062 (2023) - Zeev Nutov:
An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. CiE 2023: 287-296 - Jiachen Zhang, Youcef Magnouche, Sébastien Martin, Antoine Fressancourt, J. Christopher Beck:
The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm. CoDIT 2023: 477-482 - Qinghai Liu, Qinfei Tang, Jiarui Chen, Chuandong Chen, Ziran Zhu, Huan He, Jianli Chen, Yao-Wen Chang:
Disjoint-Path and Golden-Pin Based Irregular PCB Routing with Complex Constraints. DAC 2023: 1-6 - Michal Wlodarczyk, Meirav Zehavi:
Planar Disjoint Paths, Treewidth, and Kernels. FOCS 2023: 649-662
skipping 996 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-03-28 20:16 CET 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