=== 1. Crossref records for the bibliography DOIs ===
[BD93] status=200 title=['Blocking Small Cuts in a Network, and Related Problems'] container=['SIAM Journal on Computing'] vol=22 issue=3 page=482-499 year=1993 type=journal-article event=None
   authors: Bienstock, Daniel; Diaz, Nicole
[DJPSY92] status=200 title=['The complexity of multiway cuts (extended abstract)'] container=["Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC '92"] vol=None issue=None page=241-251 year=1992 type=proceedings-article event=the twenty-fourth annual ACM symposium
   authors: Dahlhaus, E.; Johnson, D. S.; Papadimitriou, C. H.; Seymour, P. D.; Yannakakis, M.
[DJPSY94] status=200 title=['The Complexity of Multiterminal Cuts'] container=['SIAM Journal on Computing'] vol=23 issue=4 page=864-894 year=1994 type=journal-article event=None
   authors: Dahlhaus, E.; Johnson, D. S.; Papadimitriou, C. H.; Seymour, P. D.; Yannakakis, M.
[Kra05 (volume)] status=200 title=['Combinatorial Optimization'] container=['Oberwolfach Reports'] vol=2 issue=4 page=2833-2932 year=2006 type=journal-article event=None
   authors: Burkard, Rainer E.; Shmoys, David B.; Zimmermann, Uwe
[BBCHHNS17] status=200 title=['Fixed-parameter algorithms for DAG Partitioning'] container=['Discrete Applied Mathematics'] vol=220 issue=None page=134-160 year=2017 type=journal-article event=None
   authors: van Bevern, René; Bredereck, Robert; Chopin, Morgan; Hartung, Sepp; Hüffner, Falk; Nichterlein, André; Suchý, Ondřej
=== 2. thesis DOI resolution (HEAD, no redirect following) ===
status=302 Location=https://leopard.tu-braunschweig.de/receive/dbbs_mods_00000049
crossref status=404 title=None type=None publisher=None year=None author=[]
=== 3. OpenAlex: thesis record, works citing it, title searches ===
openalex by DOI status=200 id=https://openalex.org/W2147325817 title=Increasing distances in graphs cited_by_count=0 year=2006
citing works: status=200 count=0 
openalex search "blocking shortest paths": status=200 count=26
   - Reconfigurable heterogeneous blocked shortest path algorithm for clustered graphs (2026) https://doi.org/10.52065/2520-6141-2026-302-10
   - RECONFIGURABLE HETEROGENEOUS BLOCKED SHORTEST PATH ALGORITHM FOR CLUSTERED GRAPHS (None) None
   - Optimization of data allocation in hierarchical memory for blocked shortest paths algorithms (2021) https://doi.org/10.21122/2309-4923-2021-3-40-50
   - Increasing distances in graphs (2006) https://doi.org/10.24355/dbbs.084-200605170200-19
   - Learning Bounded Treewidth Bayesian Networks (2008) None
   - Localization of data references in blocked heterogeneous shortest paths algorithm for clustered graphs (2025) https://doi.org/10.52065/2520-6141-2025-296-11
   - Optimization of programming teams on compatibility of programmers (2023) https://doi.org/10.52065/2520-6141-2023-272-2-15
   - Thread-safe bitset with fast extract min operation (2025) https://doi.org/10.52065/2520-6141-2025-290-10
   - New blocked all-pairs shortest paths algorithms operating on blocks of unequal sizes (2024) https://doi.org/10.21122/2309-4923-2023-4-4-13
   - Generation of shortest path search dataflow networks of actors for parallel multi-core implementation (2023) https://doi.org/10.37661/1816-0301-2023-20-2-65-84
   - Advanced heterogeneous block-parallel all-pairs shortest path algorithm (2023) https://doi.org/10.52065/2520-6141-2023-266-1-13
   - Competing all-pairs shortest paths algorithms for sparse / dense graphs: implementation and comparison (2024) https://doi.org/10.21122/2309-4923-2024-4-4-12
   - Influence of shortest path algorithms on energy consumption of multi-core processors (2023) https://doi.org/10.21122/2309-4923-2023-2-4-12
   - Каркасный алгоритм оценки схожести невзвешенных неориентированных графов (2022) https://doi.org/10.25559/sitito.18.202203.655-665
   - Blocked algorithm of finding all-pairs shortest paths in graphs divided into weakly connected clusters (2024) https://doi.org/10.21122/2309-4923-2024-2-4-10
openalex search "increasing distances in graphs": status=200 count=11
   - Increasing distances in graphs (2006) https://doi.org/10.24355/dbbs.084-200605170200-19
   - Introduction (2024) https://doi.org/10.1088/978-0-7503-6350-1ch1
   - The geography of transaction linkages in twelve European case study regions (2003) None
   - The Physics of Sound and Music, Volume 2 (2024) https://doi.org/10.1088/978-0-7503-6350-1
   - Pore‐water advection and solute fluxes in permeable marine sediments (I): Calibration and performance of the novel benthic chamber system Sandy (2005) https://doi.org/10.4319/lo.2005.50.3.0768
   - iGATTLDA: Integrative graph attention and transformer‐based model for predicting lncRNA‐Disease associations (2024) https://doi.org/10.1049/syb2.12098
   - Exploring one aspect of pedagogical content knowledge of teaching assistants using the test of understanding graphs in kinematics (2013) https://doi.org/10.1103/physrevstper.9.020120
   - From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP (2015) https://doi.org/10.1109/lics.2015.50
   - From complexity to algebra and back: digraph classes, collapsibility and the PGP (2015) https://doi.org/10.48550/arxiv.1501.04558
   - La régularisation parcimonieuse et la représentation à base de graphiques dans l'imagerie médicale (2013) None
   - Decremental All-Pairs Shortest Paths in Deterministic Near-Linear Time (2021) https://doi.org/10.48550/arxiv.2109.05621
openalex search "shortest path" interdiction "three terminals": status=200 count=8
   - Attacking Shortest Paths by Cutting Edges (2023) https://doi.org/10.1145/3622941
   - Analytical approaches to protection planning in rail-truck intermodal transportation (2015) None
   - Vulnerability and robustness in artificial intelligence for complex networks (2023) https://doi.org/10.17760/d20581983
   - On Nash-solvability in pure stationary strategies of the deterministic n -person games with perfect information and mean or total effective cost (2013) https://doi.org/10.1016/j.dam.2013.10.025
   - Combating adversaries in network-structured security domains (2018) https://doi.org/10.32657/10356/75075
   - Probabilistic Effectiveness Methodology: A holistic approach on risk assessment of nuclear smuggling (2011) https://doi.org/10.1109/ths.2011.6107891
   - On approximability and LP formulations for multicut and feedback set problems (2018) None
   - Macroeconomic Risks from Maritime Trade Disruptions (2026) https://doi.org/10.48550/arxiv.2607.09951
openalex search "length-bounded" multicut: status=200 count=46
   - Parameterized Complexity of Length-bounded Cuts and Multicuts (2018) https://doi.org/10.1007/s00453-018-0408-7
   - Network Resilience and the Length-Bounded Multicut Problem (2018) https://doi.org/10.1145/3179407
   - Network Resilience and the Length-Bounded Multicut Problem (2018) https://doi.org/10.1145/3219617.3219650
   - Network Resilience and the Length-Bounded Multicut Problem (2018) https://doi.org/10.1145/3292040.3219650
   - Network Resilience and the Length-Bounded Multicut Problem (2019) https://doi.org/10.1145/3308809.3308851
   - Length-bounded cuts: Proper interval graphs and structural parameters (2021) https://doi.org/10.1016/j.jcss.2021.12.002
   - Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters (2020) https://doi.org/10.4230/lipics.isaac.2020.36
   - Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters (2019) https://doi.org/10.48550/arxiv.1910.03409
   - Network Performance Assessment via Length‐Bounded Paths in Continuous Domain (2025) https://doi.org/10.1049/cmu2.70028
   - Length-Bounded Paths Interdiction in Continuous Domain for Network Performance Assessment (2020) https://doi.org/10.48550/arxiv.2009.09955
   - On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (2018) https://doi.org/10.2298/yjor181015034b
   - Approximate solution of length-bounded maximum multicommodity flow with unit edge-lengths (2017) https://doi.org/10.48550/arxiv.1708.00774
   - Improved Hardness for Cut, Interdiction, and Firefighter Problems (2016) https://doi.org/10.4230/lipics.icalp.2017.92
   - Structural Tractability Frontiers for Metric Repair (2026) https://doi.org/10.48550/arxiv.2607.29649
   - Algorithm design techniques for parameterized graph modification problems (2006) None
openalex search blocking shortest paths multiway cut three terminals NP-hard: status=200 count=79
   - Odd Multiway Cut in Directed Acyclic Graphs (2020) https://doi.org/10.1137/18m1176087
   - Odd multiway cut in directed acyclic graphs (2021) None
   - Cuts and Disjoint Paths in the Valley-Free Path Model (2006) https://doi.org/10.1080/15427951.2006.10129126
   - Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings (2018) https://doi.org/10.48550/arxiv.1807.09389
   - Three-Terminal Reachability-Preserving Minimum Node Cut: Planar Hardness and a General-Graph \(O(\sqrt n)\)-Approximation (2026) https://doi.org/10.48550/arxiv.2606.14906
   - Cooperative Cuts: Graph Cuts with Submodular Edge Weights (2010) None
   - Improved Hardness for Cut, Interdiction, and Firefighter Problems (2016) https://doi.org/10.4230/lipics.icalp.2017.92
   - Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs (2021) https://doi.org/10.1145/3450704
   - Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs (2019) https://doi.org/10.4230/lipics.socg.2019.27
   - Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs (2019) https://doi.org/10.48550/arxiv.1903.08603
   - Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications (2014) https://doi.org/10.14279/depositonce-4131
   - Directed Disjoint Paths Remains W[1]-Hard on Acyclic Digraphs Without Large Grid Minors (2025) https://doi.org/10.48550/arxiv.2507.09868
   - The planar multiterminal cut problem (1998) https://doi.org/10.1016/s0166-218x(98)00036-5
   - Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More (2026) https://doi.org/10.1137/1.9781611978971.203
   - Cutting-Edge Algorithms for Monotone Graph Classes (2024) https://doi.org/10.33540/2502
openalex Stefan Krause 2004-2012: status=400 count=None
=== 4. Semantic Scholar ===
S2 search 'blocking shortest paths': status=429 total=None
S2 search 'increasing distances in graphs Krause': status=None total=None
S2 search 'shortest path interdiction multiple pairs unit increase': status=429 total=None
S2 search 'length-bounded multicut': status=429 total=None
S2 search 'multiway cut geodesic shortest paths three terminals': status=429 total=None
S2 thesis by DOI: status=404 title=None citationCount=None citations=[]
=== 5. arXiv API ===
arxiv all:"blocking shortest paths": status=200 total=['0']
arxiv all:"shortest path interdiction" AND all:pairs: status=200 total=['1']
   - 1607.05133v1 Improved Hardness for Cut, Interdiction, and Firefighter Problems
arxiv all:"length-bounded" AND all:multicut: status=200 total=['2']
   - 1607.05133v1 Improved Hardness for Cut, Interdiction, and Firefighter Problems
   - 2607.29649v1 Structural Tractability Frontiers for Metric Repair
arxiv all:"length-bounded cut": status=200 total=['4']
   - 1910.03409v1 Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters
   - 1511.02801v1 Parameterized complexity of length-bounded cuts and multi-cuts
   - 1607.05133v1 Improved Hardness for Cut, Interdiction, and Firefighter Problems
   - 1512.00333v3 Fractals for Kernelization Lower Bounds
arxiv all:"shortest path" AND all:"multiway cut": status=200 total=['3']
   - 1807.09389v1 Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings
   - 1607.05133v1 Improved Hardness for Cut, Interdiction, and Firefighter Problems
   - 1405.4960v3 Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems
arxiv all:"increasing distances" AND all:graph: status=200 total=['8']
   - 2111.12951v1 Reliable Graph Neural Networks for Drug Discovery Under Distributional Shift
   - 2404.06383v2 Ordering and Convergence of Large Degrees in Random Hyperbolic Graphs
   - 1506.02386v2 Reverse Ranking by Graph Structure: Model and Scalable Algorithms
   - 1802.09597v1 Mapping the Invocation Structure of Online Political Interaction
   - cond-mat/0004163v1 Random spread on the family of small-world networks
   - 2604.22171v1 MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search
   - 2602.16417v1 Network geometry of the Drosophila brain
   - 1509.01990v2 Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
arxiv all:"most vital edges" AND all:"shortest path" AND all:pairs: status=200 total=['0']
arxiv all:"geodesic" AND all:"multiway cut": status=200 total=['1']
   - 2509.01413v1 Hitting Geodesic Intervals in Structurally Restricted Graphs
=== 6. zbMATH Open API ===
zbmath ti:"blocking shortest paths": status=404 n=0
zbmath an:1238.05002: status=200 n=1
   - 1238.05002 Increasing distances in graphs (2006) ['Krause, Stefan']
     review text: Summary: In der vorliegenden Arbeit wird ein spezielles \textsc{Set Cover} Problem studiert, das bislang in der Literatur nicht diskutiert wurde. Es ist eng mit minimalen Schnitten in Graphen verknüpft. Im Unterschied zu letztgenannten Problemen wird bei dem hier betrachteten nicht gefordert, alle Wege zwischen den Knoten eines oder mehrerer gegebener Knotenpaare zu unterbrechen, sondern es reicht aus, die kürzesten Wege zu durchtrennen. Mit anderen Worten besteht die Aufgabe darin, in einem ungerichteten Graphen den Abstand zwischen den Knoten gegebener Paare durch Entfernen einer kostenminimalen Kantenmenge um mindestens 1 zu erhöhen. Das Problem wird als \textsc{Blocking Shortest Paths} oder kurz BSP bezeichnet. Nach der Einleitung werden im zweiten Kapitel grundlegende Begriffe und Zusammenhänge der Gebiete Graphentheorie, Komplexitätstheorie und Diskrete Optimierung, die in dieser Arbeit benötigt werden, zusammengestellt. In Kapitel 3 werden dann verwandte Probleme, die in der Literatur behandelt wurden, sowie bekannte Resultate dazu kurz vorgestellt. Die Komplexität von BSP wird in Kapitel 4 betrachtet. Dabei werden bezüglich der Anzahl der Knotenpaare des Graphen und der Kosten spezielle Fälle diskutiert und jeweils NP-Vollständigkeitsbeweise oder polynomielle Algorithmen angegeben. Lediglich für den Fall von BSP mit drei Paaren die ein Dreieck bilden, bleibt der P/NP-Status offen. Im fünften Kapitel werden nicht-algorithmische Fragen behandelt. Dabei geht es um Abschätzungen des optimalen Zielfunktionswertes von Instanzen mit Einheitskosten, um die Dualitätslücke, sowie um die Anzahl der kürzesten Wege zwischen zwei Knoten eines Graphen. In Kapitel 6 werden zwei Ansätze zur Lösung von BSP mittels ganzzahliger linearer Optimierung vorgestellt. Der erste ist die naheliegende \textsc{Set Cover} basierte Formulierung, der zweite basiert auf der LP-Formulierung für das \textsc{Minimum Cut} Problem. Zur Approximation von BSP werden in Kapitel 7 vier Standardtechniken angewandt. Die bestmögliche Approximationsgarantie wird in drei Fällen exakt bestimmt und im vierten Fall relativ eng eingegrenzt. Praktische Ergebnisse, die für zufällige BSP Instanzen die Rechenzeiten und die Approximationsgüte zeigen, werden in Kapitel 8 vorgestellt. Im letzen Kapitel werden schließlich naheliegende Erweiterungen und Variationen der betrachteten Fragestellung studiert. Es handelt sich um das BSP entsprechende Problem in gerichteten Graphen, um das Problem die Abstände um genau 1 zu erhöhen, sowie um das Problem die Abstände um mindestens \(d\geq 2\) zu erhöhen. Es werden jeweils NP-Vollständigkeitsbeweise angegeben.
zbmath au:Krause, Stefan & py:2004-2012: status=200 n=13
   - 1112.05069 Distance Ramsey numbers (2006) ['Harborth, Heiko', 'Krause, Stefan']
   - 1135.05012 Latin triangle and hexagon boards (2007) ['Harborth, Heiko', 'Krause, Stefan']
   - 1090.05015 Magic Euclidean gameboards (2005) ['Harborth, Heiko', 'Krause, Stefan']
   - 1070.20060 Realizability of modules over Tate cohomology. (2004) ['Benson, David', 'Krause, Henning', 'Schwede, Stefan']
   - 1107.20043 Introducing to realizability of modules over Tate cohomology. (2005) ['Benson, David', 'Krause, Henning', 'Schwede, Stefan']
   - 1276.82063 Diffusive semiconductor moment equations using Fermi-Dirac statistics (2011) ['Jüngel, Ansgar', 'Krause, Stefan', 'Pietra, Paola']
   - 1138.35080 A hierarchy of diffusive higher-order moment equations for semiconductors (2007) ['Jüngel, Ansgar', 'Krause, Stefan', 'Pietra, Paola']
   - 1173.90482 On minimum \(k\)-modal partitions of permutations (2008) ['Di Stefano, Gabriele', 'Krause, Stefan', 'Lübbecke, Marco E.', 'Zimmermann, Uwe T.']
   - 1145.90435 On minimum \(k\)-modal partitions of permutations (2006) ['Di Stefano, Gabriele', 'Krause, Stefan', 'Lübbecke, Marco E.', 'Zimmermann, Uwe T.']
   - 1238.05002 Increasing distances in graphs (2006) ['Krause, Stefan']
   - 1139.05332 Multicolor Euclidean gameboard Ramsey numbers (2005) ['Bode, Jens-P.', 'Krause, Stefan']
   - 1146.68383 Measuring time using connected hourglasses (2007) ['Bode, Jens-P.', 'Krause, Stefan', 'Kröller, Alexander']
   - 1109.18301 Report 8/2006: Mini-workshop: Thick subcategories -- classifications and applications (February 19th -- February 25th, 2006) (2006) []
zbmath ti:"length-bounded" & ti:cut: status=200 n=2
   - 1388.68111 Fractals for kernelization lower bounds, with an application to length-bounded cut problems (2016) ['Fluschnik, Till', 'Hermelin, Danny', 'Nichterlein, André', 'Niedermeier, Rolf']
   - None How to cut a ball without separating: improved approximations for length bounded cut (2020) ['Chlamtáč, Eden', 'Kolman, Petr']
zbmath ti:"shortest path" & ti:interdiction & py:2006-2026: status=200 n=20
   - 1171.90345 Shortest path network interdiction with asymmetric information (2008) ['Bayrak, Halil', 'Bailey, Matthew D.']
   - 1390.90124 Dynamic shortest-path interdiction (2016) ['Sefair, Jorge A.', 'Smith, J. Cole']
   - 1185.90198 Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction (2006) ['Khachiyan, Leonid', 'Gurvich, Vladimir', 'Zhao, Jihui']
   - 1534.90032 Shortest path network interdiction with asymmetric uncertainty (2024) ["Punla-Green, She'ifa Z.", 'Mitchell, John E.', 'Gearhart, Jared L.', 'Hart, William E.', 'Phillips, Cynthia A.']
   - 1348.91077 Risk-averse shortest path interdiction (2016) ['Song, Yongjia', 'Shen, Siqian']
   - 1398.91165 Sequential shortest path interdiction with incomplete information (2016) ['Borrero, Juan S.', 'Prokopyev, Oleg A.', 'Sauré, Denis']
   - 1559.91067 Monte Carlo tree search for dynamic shortest-path interdiction (2024) ['Bochkarev, Alexey A.', 'Smith, J. Cole']
   - 1466.90119 Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (2021) ['Zhang, Qiao', 'Guan, Xiucui', 'Pardalos, Panos M.']
   - 1466.91067 The shortest path interdiction problem with randomized interdiction strategies: complexity and algorithms (2021) ['Holzmann, Tim', 'Smith, J. Cole']
   - 1477.90120 Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (2021) ['Zhang, Qiao', 'Guan, Xiucui', 'Wang, Hui', 'Pardalos, Panos M.']
   - arXiv:2504.05190 Maximum Shortest Path Interdiction Problem by Upgrading Nodes on Trees under Unit Cost (2025) ['Qiao Zhang', 'Xiao Li', 'Xiucui Guan', 'Panos M. Pardalos']
   - 1418.90056 Shortest path interdiction problem with arc improvement recourse: A multiobjective approach (2019) ['Holzmann, Tim', 'Smith, J. Cole']
   - 1538.90041 Shortest path interdiction problem with convex piecewise-linear costs (2023) ['Tayyebi, Javad', 'Deaconu, Adrian M.', 'Bigdeli, Hamid', 'Niksirat, Malihe']
   - 1547.90214 Shortest path network interdiction with incomplete information: a robust optimization approach (2024) ['Azizi, Elnaz', 'Seifi, Abbas']
   - 1511.90106 Sequential shortest path interdiction with incomplete information and limited feedback (2021) ['Yang, Jing', 'Borrero, Juan S.', 'Prokopyev, Oleg A.', 'Sauré, Denis']
   - 1557.90113 A modified scenario bundling method for shortest path network interdiction under endogenous uncertainty (2024) ['Sadeghi, Somayeh', 'Seifi, Abbas']
   - arXiv:2004.08338 The two player shortest path network interdiction problem (2020) ['Simon Busam', 'Luca E. Schäfer', 'Stefan Ruzika']
   - 1584.68139 Complexity of the temporal shortest path interdiction problem (2023) ['Boeckmann, Jan', 'Thielen, Clemens', 'Wittmann, Alina']
   - 1514.90237 An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (2023) ['Lei, Yi', 'Shao, Hu', 'Wu, Ting', 'Liu, Pengjie']
   - 1574.90192 Optimal sequential stochastic shortest path interdiction (2025) ['Borrero, Juan S.', 'Sauré, Denis', 'Trigo, Natalia']
zbmath rf:Krause & ti:distances & py:2006-2026: status=404 n=0
done
