On Weighted Graph Separation Problems and Flow Augmentation-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On Weighted Graph Separation Problems and Flow Augmentation

Published:2024-01-08 Issue:1 Volume:38 Page:170-189
ISSN:0895-4801
Container-title:SIAM Journal on Discrete Mathematics
language:en
Short-container-title:SIAM J. Discrete Math.

Author:

Kim Eun Jung¹^ORCID,Masařík Tomáš²^ORCID,Pilipczuk Marcin²^ORCID,Sharma Roohani³,Wahlström Magnus⁴^ORCID

Affiliation:

1. Université Paris-Dauphine, PSL Research University, CNRS, UMR, 7243, LAMSADE, 75016 Paris, France.

2. University of Warsaw, 02-097 Warsaw, Poland.

3. Max Planck Institute for Informatics, Saarland Informatics Campus, 66123 Saarbrücken, Germany.

4. Royal Holloway, University of London, Egham TW20 0EX, UK.

Funder

Agence Nationale de la Recherche

Horizon 2020 Framework Programme

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Reference27 articles.

1. The complexity of temporal constraint satisfaction problems

2. Multicut Is FPT

3. A fixed-parameter algorithm for the directed feedback vertex set problem

4. Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable

5. Designing FPT Algorithms for Cut Problems Using Randomized Contractions

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP