Pith. sign in

REVIEW 1 minor 259 references

Multi-Source Reachability in Near-Optimal Time

T0 review · 0 major / 1 minor · reviewed 2026-06-25 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A deterministic algorithm computes reachable sets from n^σ sources in Õ(n^{ω(σ)}) time.

desk verdict This paper claims a deterministic Õ(n^{ω(σ)}) algorithm for multi-source reachability that improves the prior randomized bound. read the letter →

arxiv 2606.25612 v1 pith:RIHUNSW2 submitted 2026-06-24 cs.DS

Shimon Kogan , Merav Parter This is my paper · ORCID
classification cs.DS
keywords multi-sourcereachabilitydirectedgraphsrectangularmatrixmultiplicationdeterministicalgorithmsgraphtransitiveclosure
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper establishes a deterministic algorithm for the multi-source reachability problem on directed graphs. Given a graph with n vertices and a source set of size n^σ, the algorithm returns all vertices reachable from any source in the set. The running time matches the cost of rectangular matrix multiplication with the corresponding dimensions. A sympathetic reader would care because reachability is a core primitive in graph processing and this bound improves on the prior best randomized solution while removing randomness.

What carries the argument

Reduction of multi-source reachability to one rectangular matrix multiplication whose exponent is ω(σ).

What would settle it

An explicit dense graph family with |S| = n^{0.3} on which any correct algorithm requires Ω(n^{1.1}) time would falsify the near-optimality claim.

Watch

Extended reading notes

Core claim

The authors give a deterministic reduction from multi-source reachability to rectangular matrix multiplication. For a source set S of size n^σ the procedure runs in Õ(n^{ω(σ)}) time, where ω(σ) is the exponent for multiplying an n^σ-by-n matrix by an n-by-n matrix. When the graph is dense this yields near-linear time for every σ up to roughly 0.32, surpassing the previous n^{1+2/3ω(σ)}-time randomized bound.

Load-bearing premise

The known upper bound on the rectangular matrix multiplication exponent ω(σ) is treated as given and the reduction is assumed to preserve that exact exponent.

Editorial extensions

If this is right

  • Reachability from up to n^{0.32} sources becomes solvable in near-linear time on dense directed graphs.
  • The deterministic bound removes the need for randomization in the previous n^{1 + 2/3 ω(σ)} solution.
  • Any future improvement to rectangular matrix multiplication immediately improves the reachability time.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same reduction technique may apply to other problems whose current best algorithms rely on fast rectangular multiplication.
  • In practice the method could accelerate network reachability queries when the number of sources is a moderate power of n.
  • Extending the approach to dynamic or weighted graphs would be a natural next algorithmic target.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Request a human review

A listed scientist reviews the paper for a fee and the review publishes here regardless of verdict. See the reviewers or get listed.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 1 minor

Summary. The manuscript claims a deterministic algorithm for multi-source reachability on n-vertex digraphs with |S|=n^σ sources that runs in ilde{O}(n^{\omega(\sigma)}) time, obtained by reducing the problem to a single rectangular matrix multiplication over the appropriate semiring and invoking the known rectangular matrix-multiplication exponent \omega(\sigma) from prior literature; this improves the prior randomized bound of n^{1 + 2/3 \omega(\sigma)}.

Significance. If the claimed reduction holds, the result is significant: it supplies a deterministic near-optimal solution that breaks the super-quadratic barrier for dense graphs when |S| ≤ n^{0.32} and yields near-linear time. The direct reduction to one rectangular matrix multiplication (rather than a sequence whose cost would exceed the single-multiplication bound) together with the parameter-free expression in terms of the externally defined \omega(\sigma) is a clear strength.

minor comments (1)
  1. [Abstract] Abstract: a single sentence sketching the reduction (e.g., “by a direct reduction to one rectangular matrix multiplication over the (min,+) semiring”) would make the high-level contribution clearer to readers who do not consult the full text.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive review, the accurate summary of our contribution, and the recommendation to accept. We are pleased that the significance of the deterministic near-optimal bound and the direct reduction to a single rectangular matrix multiplication are recognized.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity identified

full rationale

The paper's claimed running time is expressed directly as Õ(n^{ω(σ)}) by reducing multi-source reachability to a single rectangular matrix multiplication instance whose exponent ω(σ) is imported unchanged from prior external literature. No equations or steps in the provided abstract define ω(σ) internally, fit parameters to the target result, or rely on self-citations for the uniqueness or correctness of the reduction. The construction is therefore self-contained against external algebraic benchmarks and does not reduce to its own inputs by definition.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

The central claim rests on the rectangular matrix multiplication exponent ω(σ) being available from prior literature; no free parameters, ad-hoc axioms, or new entities are introduced in the abstract.

assumptions (1)
  • standard math Rectangular matrix multiplication of an n^σ × n matrix by an n × n matrix can be performed in n^{ω(σ)} time
    The algorithm's running time is defined in terms of this exponent taken from prior work.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Multi-Source Reachability in Near-Optimal Time." pith.science (2026). https://pith.science/paper/RIHUNSW2

@misc{pith2026260625612,
  author       = {Pith},
  title        = {Pith review of: Multi-Source Reachability in Near-Optimal Time},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RIHUNSW2}},
  note         = {Machine review of arXiv:2606.25612}
}
abstract

The multi-source reachability problem asks to compute the reachable sets from a given subset of source vertices. For $n$-vertex digraphs $G=(V,E)$ and a subset of sources $S \subseteq V$ with $|S|=n^{\sigma}$ for some $\sigma \in [0,1]$, we present a near-optimal deterministic algorithm that solves this problem in $\tilde{O}(n^{\omega(\sigma)})$ time, where $\omega(\sigma)$ is the rectangular matrix multiplication exponent for multiplying an $n^{\sigma}\times n$ matrix by an $n \times n$ matrix. For dense graphs, this yields reachability from up to $n^{0.32}$ sources in near-linear time, breaking the super-quadratic time barrier and improving over the state-of-the-art $n^{1+2/3\omega(\sigma)}$-time randomized algorithm of Elkin and Trehan [arXiv:2401.05628, 2024].

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

259 extracted references · 93 canonical work pages

  1. [1]

    Faster and unified algorithms for diameter reducing shortcuts and minimum chain covers

    Shimon Kogan and Merav Parter , editor =. Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Covers , booktitle =. 2023 , url =. doi:10.1137/1.9781611977554.CH9 , timestamp =

    work page doi:10.1137/1.9781611977554.ch9 2023

  2. [2]

    Journal of Algorithms , volume =

    Edith Cohen , title =. Journal of Algorithms , volume =. 1996 , month = sep, doi =

    1996

  3. [3]

    Faster join-projects and sparse matrix multiplications , booktitle =

    Rasmus Resen Amossen and Rasmus Pagh , editor =. Faster join-projects and sparse matrix multiplications , booktitle =

  4. [4]

    Communications of the ACM , volume=

    Programming parallel algorithms , author=. Communications of the ACM , volume=. 1996 , publisher=

    1996

  5. [5]

    Fineman , editor =

    Nairen Cao and Jeremy T. Fineman , editor =. Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth , booktitle =

  6. [6]

    The Time Complexity of Fully Sparse Matrix Multiplication , booktitle =

    Amir Abboud and Karl Bringmann and Nick Fischer and Marvin K. The Time Complexity of Fully Sparse Matrix Multiplication , booktitle =

  7. [7]

    Woodruff and Qin Zhang , editor =

    Dirk Van Gucht and Ryan Williams and David P. Woodruff and Qin Zhang , editor =. The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication , booktitle =

  8. [8]

    Michele Borassi , title =. Inf. Process. Lett. , volume =. 2016 , url =. doi:10.1016/J.IPL.2016.05.002 , timestamp =

    work page doi:10.1016/j.ipl.2016.05.002 2016

Show all 259 references
  1. [9]

    Blelloch and Bruce M

    Guy E. Blelloch and Bruce M. Maggs , editor =. Parallel Algorithms , booktitle =. 1999 , url =. doi:10.1201/9781420049503-C48 , timestamp =

    1999 doi

  2. [10]

    Into the Square: On the Complexity of Some Quadratic-time Solvable Problems , booktitle =

    Michele Borassi and Pierluigi Crescenzi and Michel Habib , editor =. Into the Square: On the Complexity of Some Quadratic-time Solvable Problems , booktitle =

  3. [11]

    Edith Cohen , title =. J. Comput. Syst. Sci. , volume =. 1997 , url =. doi:10.1006/JCSS.1997.1534 , timestamp =

    1997 doi

  4. [12]

    Proceedings of the 37th

    Adam Karczmarz and Bartlomiej Lewandowski , title =. Proceedings of the 37th

  5. [13]

    Journal of the ACM (JACM) , volume=

    Time-work tradeoffs for parallel algorithms , author=. Journal of the ACM (JACM) , volume=. 1997 , publisher=

    1997

  6. [14]

    22nd Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, USA, 28-30 October 1981 , pages =

    Don Coppersmith and Shmuel Winograd , title =. 22nd Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, USA, 28-30 October 1981 , pages =. 1981 , url =. doi:10.1109/SFCS.1981.27 , timestamp =

    1981 doi

  7. [15]

    Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures , pages=

    Improved work span tradeoff for single source reachability and approximate shortest paths , author=. Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures , pages=

  8. [16]

    Proceedings of the 37th

    Jan van den Brand and Hossein Gholizadeh and Yonggang Jiang and Tijn de Vos , title =. Proceedings of the 37th

  9. [17]

    Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth , booktitle =

    Arpit Agarwal and Sanjeev Khanna and Huan Li and Prathamesh Patil and Chen Wang and Nathan White and Peilin Zhong , editor =. Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth , booktitle =

  10. [18]

    Pan , title =

    Xiaohan Huang and Victor Y. Pan , title =. J. Complex. , volume =. 1998 , url =. doi:10.1006/JCOM.1998.0476 , timestamp =

    1998 doi

  11. [19]

    Raimund Seidel , title =. J. Comput. Syst. Sci. , volume =. 1995 , url =. doi:10.1006/JCSS.1995.1078 , timestamp =

    1995 doi

  12. [20]

    CoRR , volume =

    Michael Elkin and Chhaya Trehan , title =. CoRR , volume =. 2024 , url =. doi:10.48550/ARXIV.2401.05628 , eprinttype =. 2401.05628 , timestamp =

    2024 doi

  13. [21]

    Closing the Gap Between Directed Hopsets and Shortcut Sets , booktitle =

    Aaron Bernstein and Nicole Wein , editor =. Closing the Gap Between Directed Hopsets and Shortcut Sets , booktitle =. 2023 , url =. doi:10.1137/1.9781611977554.CH7 , timestamp =

    2023 doi

  14. [22]

    Minimum Path Cover in Parameterized Linear Time , journal =

    Manuel C. Minimum Path Cover in Parameterized Linear Time , journal =. 2022 , url =. doi:10.48550/ARXIV.2211.09659 , eprinttype =. 2211.09659 , timestamp =

    2022 doi

  15. [23]

    2024 , url =

    Amir Abboud and Greg Bodwin , title =. 2024 , url =. doi:10.1137/21M1442176 , timestamp =

    2024 doi

  16. [24]

    Uri Zwick , title =. J. 2002 , url =. doi:10.1145/567112.567114 , timestamp =

    2002 doi

  17. [25]

    33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992 , pages =

    Noga Alon and Zvi Galil and Oded Margalit and Moni Naor , title =. 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992 , pages =. 1992 , url =. doi:10.1109/SFCS.1992.267748 , timestamp =

    1992 doi

  18. [26]

    Optimal Short Cycle Decomposition in Almost Linear Time , booktitle =

    Merav Parter and Eylon Yogev , editor =. Optimal Short Cycle Decomposition in Almost Linear Time , booktitle =. 2019 , url =. doi:10.4230/LIPICS.ICALP.2019.89 , timestamp =

    2019 doi

  19. [27]

    Liu and Richard Peng and Maximilian Probst Gutenberg and Sushant Sachdeva , title =

    Li Chen and Rasmus Kyng and Yang P. Liu and Richard Peng and Maximilian Probst Gutenberg and Sushant Sachdeva , title =. 63rd. 2022 , url =. doi:10.1109/FOCS54457.2022.00064 , timestamp =

    2022 doi

  20. [28]

    Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time , booktitle =

    Manuel C. Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time , booktitle =. 2022 , url =. doi:10.1137/1.9781611977073.18 , timestamp =

    2022 doi

  21. [29]

    Minimum Chain Cover in Almost Linear Time , booktitle =

    Manuel C. Minimum Chain Cover in Almost Linear Time , booktitle =. 2023 , url =. doi:10.4230/LIPICS.ICALP.2023.31 , timestamp =

    2023 doi

  22. [30]

    Decreasing the diameter of bounded degree graphs , journal =

    Noga Alon and Andr. Decreasing the diameter of bounded degree graphs , journal =. 2000 , url =. doi:10.1002/1097-0118(200011)35:3\<161::AID-JGT1\>3.0.CO;2-Y , timestamp =

    2000 doi

  23. [31]

    arXiv preprint arXiv:2211.06920 , year=

    Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets , author=. arXiv preprint arXiv:2211.06920 , year=

  24. [32]

    Greg Bodwin and Gary Hoppenworth , title =. 64th

  25. [33]

    Shimon Kogan and Merav Parter , title =. 63rd

  26. [34]

    CoRR , volume =

    Greg Bodwin , title =. CoRR , volume =. 2023 , url =. doi:10.48550/ARXIV.2305.18647 , eprinttype =

    2023 doi

  27. [35]

    Sparse Distance Preservers and Additive Spanners , journal =

    B. Sparse Distance Preservers and Additive Spanners , journal =. 2005 , url =. doi:10.1137/S0895480103431046 , timestamp =

    2005 doi

  28. [36]

    A Unified Framework for Light Spanners , booktitle =

    Hung Le and Shay Solomon , editor =. A Unified Framework for Light Spanners , booktitle =

  29. [37]

    Don Coppersmith and Michael Elkin , title =

  30. [38]

    Michael Elkin and Ofer Neiman and Shay Solomon , title =

  31. [39]

    Beating Matrix Multiplication for n

    Shimon Kogan and Merav Parter , editor =. Beating Matrix Multiplication for n. 49th International Colloquium on Automata, Languages, and Programming,. 2022 , url =. doi:10.4230/LIPICS.ICALP.2022.82 , timestamp =

    2022 doi

  32. [40]

    Greg Bodwin , title =

  33. [41]

    Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths , booktitle =

    Michael Elkin and Ofer Neiman , editor =. Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths , booktitle =

  34. [42]

    Efficient Algorithms for Constructing Very Sparse Spanners and Emulators , booktitle =

    Michael Elkin and Ofer Neiman , editor =. Efficient Algorithms for Constructing Very Sparse Spanners and Emulators , booktitle =

  35. [43]

    Uri Ben. New (. Proceedings of the 2020

    2020

  36. [44]

    A Unified Framework for Hopsets , booktitle =

    Ofer Neiman and Idan Shabat , editor =. A Unified Framework for Hopsets , booktitle =

  37. [45]

    Baratz and David Peleg , editor =

    Baruch Awerbuch and Alan E. Baratz and David Peleg , editor =. Cost-Sensitive Analysis of Communication Protocols , booktitle =. 1990 , url =. doi:10.1145/93385.93417 , timestamp =

    1990 doi

  38. [46]

    Michael Elkin and Seth Pettie , title =

  39. [47]

    Michael Elkin and Idan Shabat , title =. 64th

  40. [48]

    Sparse distance preservers and additive spanners , booktitle =

    B. Sparse distance preservers and additive spanners , booktitle =

  41. [49]

    Michael Elkin and Arnold Filtser and Ofer Neiman , title =. Theor. Comput. Sci. , volume =

  42. [50]

    Seth Pettie , title =

  43. [51]

    On Sparse Spanners of Weighted Graphs , journal =

    Ingo Alth. On Sparse Spanners of Weighted Graphs , journal =

  44. [52]

    Near-Optimal Light Spanners , journal =

    Shiri Chechik and Christian Wulff. Near-Optimal Light Spanners , journal =. 2018 , url =. doi:10.1145/3199607 , timestamp =

    2018 doi

  45. [53]

    Linear Size Distance Preservers , booktitle =

    Greg Bodwin , editor =. Linear Size Distance Preservers , booktitle =

  46. [54]

    Combinatorics (Keszthely, 1976), Coll

    Triple systems with no six points carrying three triangles , author=. Combinatorics (Keszthely, 1976), Coll. Math. Soc. J. Bolyai , volume=

    1976

  47. [55]

    Proceedings of the National Academy of Sciences , volume=

    On sets of integers which contain no three terms in arithmetical progression , author=. Proceedings of the National Academy of Sciences , volume=. 1946 , publisher=

    1946

  48. [56]

    Annals of Mathematics , pages=

    A new proof of the graph removal lemma , author=. Annals of Mathematics , pages=. 2011 , publisher=

    2011

  49. [57]

    Aho and M

    Alfred V. Aho and M. R. Garey and Jeffrey D. Ullman , title =. 1972 , url =. doi:10.1137/0201008 , timestamp =

    1972 doi

  50. [58]

    Spencer , title =

    Hanmao Shi and Thomas H. Spencer , title =. J. Algorithms , volume =

  51. [59]

    Klein and Sairam Subramanian , title =

    Philip N. Klein and Sairam Subramanian , title =. J. Algorithms , volume =

  52. [60]

    A Faster Distributed Single-Source Shortest Paths Algorithm , booktitle =

    Sebastian Forster and Danupon Nanongkai , editor =. A Faster Distributed Single-Source Shortest Paths Algorithm , booktitle =

  53. [61]

    Amir Abboud and Greg Bodwin and Seth Pettie , title =

  54. [62]

    Annals of Mathematics , pages =

    Jacob Fox , title =. Annals of Mathematics , pages =

  55. [63]

    An Improved Construction of Progression-Free Sets , booktitle =

    Michael Elkin , editor =. An Improved Construction of Progression-Free Sets , booktitle =

  56. [64]

    Better Distance Preservers and Additive Spanners , booktitle =

    Greg Bodwin and Virginia Vassilevska Williams , editor =. Better Distance Preservers and Additive Spanners , booktitle =

  57. [65]

    New Additive Emulators , booktitle =

    Shimon Kogan and Merav Parter , editor =. New Additive Emulators , booktitle =

  58. [66]

    CoRR , volume =

    Michael Elkin and Ofer Neiman , title =. CoRR , volume =. 2020 , url =

    2020

  59. [67]

    Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in

    Michael Elkin and Ofer Neiman , editor =. Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in. The 31st

  60. [68]

    Thorup-Zwick emulators are universally optimal hopsets , journal =

    Shang. Thorup-Zwick emulators are universally optimal hopsets , journal =

  61. [69]

    Proceedings of the Seventeenth Annual

    Mikkel Thorup and Uri Zwick , title =. Proceedings of the Seventeenth Annual

  62. [70]

    Edith Cohen , title =. J

  63. [71]

    Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles , booktitle =

    Mikkel Thorup , editor =. Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles , booktitle =. 2004 , url =. doi:10.1007/978-3-540-27810-8\_33 , timestamp =

    2004 doi

  64. [72]

    Floyd , title =

    Robert W. Floyd , title =. Commun. 1962 , url =. doi:10.1145/367766.368168 , timestamp =

    1962 doi

  65. [73]

    Johnson , title =

    Donald B. Johnson , title =. J. 1977 , url =. doi:10.1145/321992.321993 , timestamp =

    1977 doi

  66. [74]

    Italiano and Aleksander Lukasiewicz and Nikos Parotsidis and Przemyslaw Uznanski , editor =

    Fabrizio Grandoni and Giuseppe F. Italiano and Aleksander Lukasiewicz and Nikos Parotsidis and Przemyslaw Uznanski , editor =. All-Pairs. Proceedings of the 2021. 2021 , url =. doi:10.1137/1.9781611976465.18 , timestamp =

    2021 doi

  67. [75]

    Graphs Comb

    Noga Alon , title =. Graphs Comb. , volume =. 1990 , url =. doi:10.1007/BF01787474 , timestamp =

    1990 doi

  68. [76]

    Finding Sparser Directed Spanners , booktitle =

    Piotr Berman and Sofya Raskhodnikova and Ge Ruan , editor =. Finding Sparser Directed Spanners , booktitle =

  69. [77]

    Woodruff , title =

    Arnab Bhattacharyya and Elena Grigorescu and Kyomin Jung and Sofya Raskhodnikova and David P. Woodruff , title =. 2012 , url =. doi:10.1137/110826655 , timestamp =

    2012 doi

  70. [78]

    Woodruff , editor =

    Arnab Bhattacharyya and Elena Grigorescu and Kyomin Jung and Sofya Raskhodnikova and David P. Woodruff , editor =. Transitive-closure spanners , booktitle =

  71. [79]

    Transitive-Closure Spanners:

    Sofya Raskhodnikova , editor =. Transitive-Closure Spanners:. Property Testing - Current Research and Surveys , series =. 2010 , url =. doi:10.1007/978-3-642-16367-8\_10 , timestamp =

    2010 doi

  72. [80]

    Fineman , title =

    Jeremy T. Fineman , title =

  73. [81]

    A Deterministic Parallel

    Adam Karczmarz and Piotr Sankowski , editor =. A Deterministic Parallel. Proceedings of the 2021

    2021

  74. [82]

    Liu and Arun Jambulapati and Aaron Sidford , editor =

    Yang P. Liu and Arun Jambulapati and Aaron Sidford , editor =. Parallel Reachability in Almost Linear Work and Square Root Depth , booktitle =

  75. [83]

    Fineman and Katina Russell , editor =

    Nairen Cao and Jeremy T. Fineman and Katina Russell , editor =. Efficient construction of directed hopsets and parallel approximate shortest paths , booktitle =. 2020 , url =. doi:10.1145/3357713.3384270 , timestamp =

    2020 doi

  76. [84]

    Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts , booktitle =

    Shang. Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts , booktitle =

  77. [85]

    Proceedings of the Fourteenth Annual

    William Hesse , title =. Proceedings of the Fourteenth Annual

  78. [86]

    On Shortcutting Digraphs , booktitle =

    Mikkel Thorup , editor =. On Shortcutting Digraphs , booktitle =

  79. [87]

    Distributed Algorithms for Planar Networks

    Mohsen Ghaffari and Bernhard Haeupler , editor =. Distributed Algorithms for Planar Networks. Proceedings of the Twenty-Seventh Annual

  80. [88]

    Low-Congestion Shortcut and Graph Parameters , booktitle =

    Naoki Kitamura and Hirotaka Kitagawa and Yota Otachi and Taisuke Izumi , editor =. Low-Congestion Shortcut and Graph Parameters , booktitle =. 2019 , url =. doi:10.4230/LIPIcs.DISC.2019.25 , timestamp =

    2019 doi

  81. [89]

    2012 , url =

    Atish Das Sarma and Stephan Holzer and Liah Kor and Amos Korman and Danupon Nanongkai and Gopal Pandurangan and David Peleg and Roger Wattenhofer , title =. 2012 , url =. doi:10.1137/11085178X , timestamp =

    2012 doi

  82. [90]

    arXiv preprint arXiv:2002.10930 , year=

    Bipartite independence number in graphs with bounded maximum degree , author=. arXiv preprint arXiv:2002.10930 , year=

    2002

  83. [91]

    Journal of Graph Theory , volume =

    Uriel Feige and Shimon Kogan , title =. Journal of Graph Theory , volume =. 2010 , url =. doi:10.1002/jgt.20456 , timestamp =

    2010 doi

  84. [92]

    arXiv preprint arXiv:2004.03245 , year=

    Biholes in balanced bipartite graphs , author=. arXiv preprint arXiv:2004.03245 , year=

    2004

  85. [93]

    Degree sequences in triangle-free graphs , journal =

    Paul Erd. Degree sequences in triangle-free graphs , journal =. 1991 , url =. doi:10.1016/0012-365X(91)90269-8 , timestamp =

    1991 doi

  86. [94]

    Domingos and Matthew Richardson , editor =

    Pedro M. Domingos and Matthew Richardson , editor =. Mining the network value of customers , booktitle =. 2001 , url =

    2001

  87. [95]

    Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs , journal =

    Paul Erd. Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs , journal =. 1993 , url =. doi:10.1006/eujc.1993.1023 , timestamp =

    1993 doi

  88. [96]

    Electron

    Yair Caro and Asaf Shapira and Raphael Yuster , title =. Electron. J. Combin. , volume =. 2014 , url =

    2014

  89. [97]

    Raphael Yuster and Uri Zwick , title =

  90. [98]

    1963 , publisher=

    Combinatorial mathematics , author=. 1963 , publisher=

    1963

  91. [99]

    West , title =

    Yair Caro and Douglas B. West , title =. Electr. J. Comb. , volume =. 2009 , url =

    2009

  92. [100]

    Kleinberg and

    David Kempe and Jon M. Kleinberg and. Maximizing the Spread of Influence through a Social Network , journal =. 2015 , url =. doi:10.4086/toc.2015.v011a004 , timestamp =

    2015 doi

  93. [101]

    SIAM Journal on Discrete Mathematics , volume=

    On the profile of multiplicities of complete subgraphs , author=. SIAM Journal on Discrete Mathematics , volume=. 2020 , publisher=

    2020

  94. [102]

    arXiv preprint arXiv:1912.03421 , year=

    Defective DP-colorings of sparse multigraphs , author=. arXiv preprint arXiv:1912.03421 , year=

    1912

  95. [103]

    Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 , journal =

    Zdenek Dvor. Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 , journal =. 2018 , url =. doi:10.1016/j.jctb.2017.09.001 , timestamp =

    2018 doi

  96. [104]

    Improper choosability of graphs and maximum average degree , journal =

    Fr. Improper choosability of graphs and maximum average degree , journal =. 2006 , url =. doi:10.1002/jgt.20155 , timestamp =

    2006 doi

  97. [105]

    Clique is Hard to Approximate Within n\(

    Johan H. Clique is Hard to Approximate Within n\(. 37th Annual Symposium on Foundations of Computer Science,. 1996 , crossref =. doi:10.1109/SFCS.1996.548522 , timestamp =

    1996 doi

  98. [106]

    1996 , url =

    37th Annual Symposium on Foundations of Computer Science,. 1996 , url =

    1996

  99. [107]

    Graph coloring with no large monochromatic components , journal =

    Nathan Linial and Ji. Graph coloring with no large monochromatic components , journal =. 2007 , url =. doi:10.1016/j.endm.2007.07.020 , timestamp =

    2007 doi

  100. [108]

    2016 , url =

    Louis Esperet and Pascal Ochem , title =. 2016 , url =. doi:10.1137/140957883 , timestamp =

    2016 doi

  101. [109]

    Graphs and Combinatorics , volume =

    Noga Alon and Shlomo Hoory and Nathan Linial , title =. Graphs and Combinatorics , volume =. 2002 , url =. doi:10.1007/s003730200002 , timestamp =

    2002 doi

  102. [110]

    The history of degenerate (bipartite) extremal graph problems , author=. Erd. 2013 , publisher=

    2013

  103. [111]

    Wood , title =

    Kevin Hendrey and David R. Wood , title =. Combinatorics, Probability. 2019 , url =. doi:10.1017/S0963548319000063 , timestamp =

    2019 doi

  104. [112]

    Haxell and Tibor Szab

    Penny E. Haxell and Tibor Szab. Bounded size components--partitions and transversals , journal =. 2003 , url =. doi:10.1016/S0095-8956(03)00031-5 , timestamp =

    2003 doi

  105. [113]

    The Electronic Journal of Combinatorics , number=

    Defective and clustered graph colouring , author=. The Electronic Journal of Combinatorics , number=

  106. [114]

    arXiv preprint arXiv:1703.09682 , year=

    On the profile of multiplicities of complete subgraphs , author=. arXiv preprint arXiv:1703.09682 , year=

    arXiv

  107. [115]

    arXiv preprint arXiv:1910.01356 , year=

    New results on large induced forests in graphs , author=. arXiv preprint arXiv:1910.01356 , year=

    1910

  108. [116]

    A Note on Ramsey Numbers , journal =

    Mikl. A Note on Ramsey Numbers , journal =. 1980 , url =. doi:10.1016/0097-3165(80)90030-8 , timestamp =

    1980 doi

  109. [117]

    Finding strongly connected components in parallel using

    Warren Schudy , editor =. Finding strongly connected components in parallel using

  110. [118]

    New Bounds for Matrix Multiplication: from Alpha to Omega , booktitle =

    Virginia. New Bounds for Matrix Multiplication: from Alpha to Omega , booktitle =

  111. [119]

    Liu and Thatchaphol Saranurak and Aaron Sidford and Zhao Song and Di Wang , editor =

    Jan van den Brand and Yin Tat Lee and Yang P. Liu and Thatchaphol Saranurak and Aaron Sidford and Zhao Song and Di Wang , editor =. Minimum cost flows, MDPs, and _1 -regression in nearly linear time for dense instances , booktitle =. 2021 , url =. doi:10.1145/3406325.3451108 ,...

    2021 doi

  112. [120]

    Ullman and Mihalis Yannakakis , title =

    Jeffrey D. Ullman and Mihalis Yannakakis , title =

  113. [121]

    Shearer , title =

    James B. Shearer , title =. Discrete Mathematics , volume =. 1983 , url =. doi:10.1016/0012-365X(83)90273-X , timestamp =

    1983 doi

  114. [122]

    arXiv preprint arXiv:1909.03422 , year=

    Target Set Selection for Conservative Populations , author=. arXiv preprint arXiv:1909.03422 , year=

    1909

  115. [123]

    Discrete Optimization , volume =

    Cristina Bazgan and Morgan Chopin , title =. Discrete Optimization , volume =. 2014 , url =. doi:10.1016/j.disopt.2014.09.004 , timestamp =

    2014 doi

  116. [124]

    arXiv preprint arXiv:1902.10983 , year=

    Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number , author=. arXiv preprint arXiv:1902.10983 , year=

    1902

  117. [125]

    Proceedings on 34th Annual

    Subhash Khot , title =. Proceedings on 34th Annual. 2002 , crossref =. doi:10.1145/509907.510017 , timestamp =

    2002 doi

  118. [126]

    2002 , isbn =

    Proceedings on 34th Annual. 2002 , isbn =

    2002

  119. [127]

    Demaine and MohammadTaghi Hajiaghayi , title =

    Erik D. Demaine and MohammadTaghi Hajiaghayi , title =. Comput. J. , volume =. 2008 , url =. doi:10.1093/comjnl/bxm033 , timestamp =

    2008 doi

  120. [128]

    Approximation, Randomization, and Combinatorial Optimization

    Moses Charikar and Yonatan Naamad and Anthony Wirth , title =. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques,. 2016 , crossref =. doi:10.4230/LIPIcs.APPROX-RANDOM.2016.4 , timestamp =

    2016 doi

  121. [129]

    Algorithms and Techniques,

    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques,. 2016 , url =

    2016

  122. [130]

    Dreyer Jr

    Paul A. Dreyer Jr. and Fred S. Roberts , title =. Discrete Applied Mathematics , volume =. 2009 , url =. doi:10.1016/j.dam.2008.09.012 , timestamp =

    2009 doi

  123. [131]

    Irit Dinur and Shmuel Safra , title =. Inf. Process. Lett. , volume =. 2004 , url =. doi:10.1016/j.ipl.2003.11.007 , timestamp =

    2004 doi

  124. [132]

    Algorithmica , volume =

    Romeo Rizzi , title =. Algorithmica , volume =. 2009 , url =. doi:10.1007/s00453-007-9112-8 , timestamp =

    2009 doi

  125. [133]

    On tractable cases of Target Set Selection , journal =

    Andr. On tractable cases of Target Set Selection , journal =. 2013 , url =. doi:10.1007/s13278-012-0067-7 , timestamp =

    2013 doi

  126. [134]

    Theory of Computing , volume =

    Venkatesan Guruswami and Euiwoong Lee , title =. Theory of Computing , volume =. 2016 , url =. doi:10.4086/toc.2016.v012a006 , timestamp =

    2016 doi

  127. [135]

    Seymour , title =

    Paul D. Seymour , title =. Combinatorica , volume =. 1995 , url =. doi:10.1007/BF01200760 , timestamp =

    1995 doi

  128. [136]

    Beating the Random Ordering Is Hard: Every Ordering

    Venkatesan Guruswami and Johan H. Beating the Random Ordering Is Hard: Every Ordering. 2011 , url =. doi:10.1137/090756144 , timestamp =

    2011 doi

  129. [137]

    Theory of Computing , volume =

    Ola Svensson , title =. Theory of Computing , volume =. 2013 , url =. doi:10.4086/toc.2013.v009a024 , timestamp =

    2013 doi

  130. [138]

    Low , title =

    Hanoch Levy and David W. Low , title =. J. Algorithms , volume =. 1988 , url =. doi:10.1016/0196-6774(88)90013-2 , timestamp =

    1988 doi

  131. [139]

    2015 , url =

    Asahi Takaoka and Shuichi Ueno , title =. 2015 , url =. doi:10.1587/transinf.2015EDL8021 , timestamp =

    2015 doi

  132. [140]

    Irreversible 2-conversion set in graphs of bounded degree , journal =

    Jan Kyncl and Bernard Lidick. Irreversible 2-conversion set in graphs of bounded degree , journal =. 2017 , url =

    2017

  133. [141]

    Parameterized Inapproximability of Target Set Selection and Generalizations , journal =

    Cristina Bazgan and Morgan Chopin and Andr. Parameterized Inapproximability of Target Set Selection and Generalizations , journal =. 2014 , url =. doi:10.3233/COM-140030 , timestamp =

    2014 doi

  134. [142]

    Algorithmica , volume =

    Sumedh Tirodkar and Sundar Vishwanathan , title =. Algorithmica , volume =. 2017 , url =. doi:10.1007/s00453-017-0278-4 , timestamp =

    2017 doi

  135. [144]

    1997 , url =

    Algorithms and Complexity, Third Italian Conference,. 1997 , url =. doi:10.1007/3-540-62592-5 , isbn =

    1997 doi

  136. [145]

    Frank Thomson Leighton and Satish Rao , title =. J. 1999 , url =. doi:10.1145/331524.331526 , timestamp =

    1999 doi

  137. [146]

    Theoretical Computer Science , year=

    Whom to befriend to influence people , author=. Theoretical Computer Science , year=

  138. [148]

    2015 , url =

    Structural Information and Communication Complexity - 22nd International Colloquium,. 2015 , url =. doi:10.1007/978-3-319-25258-2 , isbn =

    2015 doi

  139. [149]

    Bodlaender and P

    Hans L. Bodlaender and P. A O(c. CoRR , volume =. 2013 , url =

    2013

  140. [150]

    Combinatorial model and bounds for target set selection , journal =

    Eyal Ackerman and Oren Ben. Combinatorial model and bounds for target set selection , journal =. 2010 , url =. doi:10.1016/j.tcs.2010.08.021 , timestamp =

    2010 doi

  141. [151]

    Treewidth governs the complexity of target set selection , journal =

    Oren Ben. Treewidth governs the complexity of target set selection , journal =. 2011 , url =. doi:10.1016/j.disopt.2010.09.007 , timestamp =

    2011 doi

  142. [152]

    Lee , title =

    Uriel Feige and MohammadTaghi Hajiaghayi and James R. Lee , title =. 2008 , url =. doi:10.1137/05064299X , timestamp =

    2008 doi

  143. [153]

    Discrete Optimization , year=

    On some tractable and hard instances for partial incentives and target set selection , author=. Discrete Optimization , year=

  144. [154]

    1986 , publisher=

    Classes of graphs with bounded tree-width , author=. 1986 , publisher=

    1986

  145. [155]

    Discrete Applied Mathematics , volume=

    Tree-width, path-width, and cutwidth , author=. Discrete Applied Mathematics , volume=. 1993 , publisher=

    1993

  146. [156]

    SIAM Journal on Discrete Mathematics , year =

    Ning Chen , title =. SIAM Journal on Discrete Mathematics , year =

  147. [157]

    Proceedings of the Forty-Seventh Annual

    Nikhil Bansal and Anupam Gupta and Guru Guruganesh , title =. Proceedings of the Forty-Seventh Annual. 2015 , crossref =. doi:10.1145/2746539.2746607 , timestamp =

    2015 doi

  148. [158]

    2015 , url =

    Proceedings of the Forty-Seventh Annual. 2015 , url =

    2015

  149. [159]

    Random Struct

    Noga Alon , title =. Random Struct. Algorithms , volume =. 1996 , url =. doi:10.1002/(SICI)1098-2418(199610)9:3<271::AID-RSA1>3.0.CO;2-U , timestamp =

    1996 doi

  150. [160]

    Shearer , title =

    James B. Shearer , title =. Random Struct. Algorithms , volume =. 1995 , url =. doi:10.1002/rsa.3240070305 , timestamp =

    1995 doi

  151. [161]

    Journal of Combinatorial Theory, Series B , volume=

    Sur le probleme de Goodman pour les quadrangles et la majoration des nombres de Ramsey , author=. Journal of Combinatorial Theory, Series B , volume=. 1979 , publisher=

    1979

  152. [162]

    Combinatorica , volume=

    Multiplicities of subgraphs , author=. Combinatorica , volume=. 1996 , publisher=

    1996

  153. [163]

    Discrete mathematics , volume=

    2-colorings of complete graphs with a small number of monochromatic K4 subgraphs , author=. Discrete mathematics , volume=. 1993 , publisher=

    1993

  154. [164]

    A disproof of a conjecture of Erd

    Thomason, Andrew , journal=. A disproof of a conjecture of Erd. 1989 , publisher=

    1989

  155. [165]

    Journal of Graph Theory , volume=

    On the Ramsey multiplicities of graphs - problems and recent results , author=. Journal of Graph Theory , volume=. 1980 , publisher=

    1980

  156. [166]

    The American Mathematical Monthly , volume=

    On sets of acquaintances and strangers at any party , author=. The American Mathematical Monthly , volume=. 1959 , publisher=

    1959

  157. [167]

    Bulletin of the American Mathematical Society , volume=

    Some remarks on the theory of graphs , author=. Bulletin of the American Mathematical Society , volume=

  158. [168]

    Compositio mathematica , volume=

    A combinatorial problem in geometry , author=. Compositio mathematica , volume=

  159. [169]

    Mathematica Slovaca , volume=

    On the Order and the Number of Cliques in a Random Graph , author=. Mathematica Slovaca , volume=. 1997 , publisher=

    1997

  160. [170]

    On the number of homogeneous subgraphs of a graph , journal =

    L. On the number of homogeneous subgraphs of a graph , journal =. 1984 , url =. doi:10.1007/BF02579149 , timestamp =

    1984 doi

  161. [171]

    Communications in Mathematical Physics , volume=

    Spectral functions, special functions and the Selberg zeta function , author=. Communications in Mathematical Physics , volume=. 1987 , publisher=

    1987

  162. [172]

    Shimon Kogan , title =. Electr. J. Comb. , volume =. 2017 , url =

    2017

  163. [173]

    Combinatorica , volume =

    David Conlon , title =. Combinatorica , volume =. 2012 , url =. doi:10.1007/s00493-012-2465-x , timestamp =

    2012 doi

  164. [174]

    Magyar Tud

    On the number of complete subgraphs contained in certain graphs , author=. Magyar Tud. Akad. Mat. Kutat

  165. [175]

    Manuscript , volume=

    New results on large induced forests in graphs , author=. Manuscript , volume=

  166. [176]

    Discrete Mathematics , volume =

    Daniel Reichman , title =. Discrete Mathematics , volume =. 2012 , url =. doi:10.1016/j.disc.2012.01.016 , timestamp =

    2012 doi

  167. [177]

    Random Struct

    Uriel Feige and Jonathan Hermon and Daniel Reichman , title =. Random Struct. Algorithms , volume =. 2016 , url =. doi:10.1002/rsa.20597 , timestamp =

    2016 doi

  168. [178]

    Diskretny analys, Novosibirsk , volume=

    On decomposition of graphs into degenerate subgraphs , author=. Diskretny analys, Novosibirsk , volume=

  169. [179]

    Cranston and Landon Rabern , title =

    Daniel W. Cranston and Landon Rabern , title =. Journal of Graph Theory , volume =. 2015 , url =. doi:10.1002/jgt.21847 , timestamp =

    2015 doi

  170. [180]

    Methods and Programs of Solutions Optimization Problems on Graphs and Networks , volume=

    A modification of a Catlin's algorithm , author=. Methods and Programs of Solutions Optimization Problems on Graphs and Networks , volume=

  171. [181]

    Journal of Graph Theory , volume =

    Landon Rabern , title =. Journal of Graph Theory , volume =. 2013 , url =. doi:10.1002/jgt.21634 , timestamp =

    2013 doi

  172. [182]

    Seymour , title =

    Noga Alon and Jeff Kahn and Paul D. Seymour , title =. Graphs and Combinatorics , volume =. 1987 , url =. doi:10.1007/BF01788542 , timestamp =

    1987 doi

  173. [183]

    Wormald , title =

    Carlos Hoppen and Nicholas C. Wormald , title =. Combinatorics, Probability. 2008 , url =. doi:10.1017/S0963548307008905 , timestamp =

    2008 doi

  174. [184]

    Journal of Graph Theory , volume =

    Lingsheng Shi and Hongyu Xu , title =. Journal of Graph Theory , volume =. 2017 , url =. doi:10.1002/jgt.22104 , timestamp =

    2017 doi

  175. [185]

    Journal of Graph Theory , volume =

    Noga Alon and Dhruv Mubayi and Robin Thomas , title =. Journal of Graph Theory , volume =. 2001 , url =. doi:10.1002/jgt.1028 , timestamp =

    2001 doi

  176. [186]

    Journal of Combinatorial Theory, Series B , volume=

    On a conjecture of Fink and Jacobson concerning k -domination and k -dependence , author=. Journal of Combinatorial Theory, Series B , volume=

  177. [187]

    The Electronic Journal of Combinatorics , volume=

    New Results on k -Independence of Graphs , author=. The Electronic Journal of Combinatorics , volume=

  178. [188]

    Congressus Numerantium , year =

    Simeon Fajtlowicz , title =. Congressus Numerantium , year =

  179. [189]

    New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier , booktitle =

    Shimon Kogan and Merav Parter , editor =. New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier , booktitle =

  180. [190]

    Discrete Applied Mathematics , volume =

    Adriana Hansberg and Ryan Pepper , title =. Discrete Applied Mathematics , volume =. 2013 , url =. doi:10.1016/j.dam.2013.02.008 , timestamp =

    2013 doi

  181. [191]

    Combinatorics Probability and Computing , year =

    Bruce Reed , title =. Combinatorics Probability and Computing , year =

  182. [192]

    Henning , title =

    Er Fang Shan and Moo Young Sohn and Xu Dong Yuan and Michael A. Henning , title =. Acta Mathematica Sinica (English Series) , year =

  183. [193]

    Ars Combinatoria , year =

    Glenn Hopkins and William Staton , title =. Ars Combinatoria , year =

  184. [194]

    Magnus M. Halld\'. Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring , journal =. 1997 , volume =

    1997

  185. [195]

    Journal of Graph Theory , year =

    Yair Caro and Zsolt Tuza , title =. Journal of Graph Theory , year =

  186. [196]

    Discrete Applied Mathematics , year =

    Asen Bojilov and Yair Caro and Adriana Hansberg and Nedyalko Nenov , title =. Discrete Applied Mathematics , year =

  187. [197]

    Spencer , title =

    Noga Alon and Joel H. Spencer , title =. 2008 , volume =

    2008

  188. [198]

    Convex Analysis and Minimization Algorithms I , year =

    Jean-Baptiste and Hiriart-Urruty and Claude Lemar\'. Convex Analysis and Minimization Algorithms I , year =

  189. [199]

    Mihalis Yannakakis , title =. J. ACM , year =

  190. [200]

    Electronic Journal of Combinatorics , year =

    Yair Caro and Adriana Hansberg , title =. Electronic Journal of Combinatorics , year =

  191. [201]

    Yair Caro , title =. Tech. Report, Tel-Aviv University , year =

  192. [202]

    V. K. Wei , title =. Bell Laboratories Technical Memorandum, 81-11217-9, Murray Hill, NJ , year =

  193. [203]

    A combinatorial problem in geometry , journal =

    Paul Erd. A combinatorial problem in geometry , journal =. 1935 , volume =

    1935

  194. [204]

    Ramsey , title =

    Frank P. Ramsey , title =. Proc. London Math. Soc. , year =

  195. [205]

    Approximations of Weighted Independent Set and Hereditary Subset Problems , journal =

    Magn\'. Approximations of Weighted Independent Set and Hereditary Subset Problems , journal =. 2000 , volume =

    2000

  196. [206]

    Lewis and Mihalis Yannakakis , title =

    John M. Lewis and Mihalis Yannakakis , title =. J. Comput. Syst. Sci. , year =

  197. [207]

    Mihir Bellare and Oded Goldreich and Madhu Sudan , title =. SIAM J. Comput. , year =

  198. [208]

    David Zuckerman , title =. SIAM J. Comput. , year =

  199. [209]

    RECOMB , year =

    Amir Ben-Dor and Tzvika Hartman and Roded Sharan and Benno Schwikowski and Zohar Yakhini , title =. RECOMB , year =

  200. [210]

    Karp and Roded Sharan and Benno Schwikowski and Zohar Yakhini , title =

    Amir Ben-Dor and Tzvika Hartman and Richard M. Karp and Roded Sharan and Benno Schwikowski and Zohar Yakhini , title =. Journal of Computational Biology, to appear , year =

  201. [211]

    1998 , volume =

    Colin McDiarmid , title =. 1998 , volume =

    1998

  202. [212]

    Phillip Hall , title =. J. London Math Soc. , year =

  203. [213]

    JCSS , year =

    Russell Impagliazzo and Ramamohan Paturi and Francis Zane , title =. JCSS , year =

  204. [214]

    FOCS , year =

    Oded Goldreich and Madhu Sudan , title =. FOCS , year =

  205. [215]

    1996 , volume =

    Philippe Flajolet and Robert Sedgewick , title =. 1996 , volume =

    1996

  206. [216]

    Paul Tur\'an , title =. Math. Fiz. Lapok , year =

  207. [217]

    Noga Alon and Nabil Kahale , title =. Math. Programming , year =

  208. [218]

    Claudio Arbib and Raffaele Mosca , title =. J. Combin. Math. Combin. Comput. , year =

  209. [219]

    Combinatorica , year =

    Thang Bui and Soma Chaudhuri and Frank Thomson Leighton and Michael Sipser , title =. Combinatorica , year =

  210. [220]

    Combinatorica , year =

    Miklףs Ajtai , title =. Combinatorica , year =

  211. [221]

    COMPUTING , year =

    Rudolf Mller and Dorothea Wagner , title =. COMPUTING , year =

  212. [222]

    Bounds for Linear VLSI-Layout Problems , journal =

    Rudolf M. Bounds for Linear VLSI-Layout Problems , journal =. 1993 , volume =

    1993

  213. [223]

    Church , title =

    Yizong Cheng and George M. Church , title =. Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology (ISMB) , year =

  214. [224]

    S. S. Ravi and Errol L. Lloyd , title =. SIAM J. Comput , year =

  215. [225]

    Kent Fuchs , title =

    Sy-Yen Kuo and W. Kent Fuchs , title =. IEEE Design and Test , year =

  216. [226]

    The maximum edge biclique problem is

    Ren. The maximum edge biclique problem is. Research Memorandum 789, Faculty of Economics and Business Administration, Tilberg University , year =

  217. [227]

    Avrim Blum , title =. Ph.D. thesis, MIT Laboratory for Computer Science MIT/LCS/TR-506 , year =

  218. [228]

    Information and Computation , year =

    Piotr Berman and Georg Schnitger , title =. Information and Computation , year =

  219. [229]

    Computational Complexity , year =

    Noga Alon and Uriel Feige and Avi Wigderson and David Zuckerman , title =. Computational Complexity , year =

  220. [230]

    manuscript , year =

    Uriel Feige , title =. manuscript , year =

  221. [231]

    Swaminathan and Sridhar Tayur , title =

    Milind Dawande and Pinar Keskinocak and Jayashankar M. Swaminathan and Sridhar Tayur , title =. J. Algorithms , year =

  222. [232]

    FOCS , year =

    Subhash Khot , title =. FOCS , year =

  223. [233]

    STOC , year =

    Aravind Srinivasan , title =. STOC , year =

  224. [234]

    Magnus M. Halld\'. Approximation of Weighted Independent Set and Hereditary Subset Problems , journal =. 2000 , volume =

    2000

  225. [235]

    Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science , year =

    Sanjeev Arora and Carsten Lund and Rajeev Motwani and Madhu Sudan and Mario Szegedy , title =. Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science , year =

  226. [236]

    Acta Mathematica , year =

    Johan Hastad , title =. Acta Mathematica , year =

  227. [237]

    Boppana and Magnus M

    Ravi B. Boppana and Magnus M. Halld\'. Approximating maximum idependent sets by excluding subgraphs , journal =. 1992 , volume =

    1992

  228. [238]

    In Approximation Algorithms for

    Sanjeev Arora and Carsten Lund , title =. In Approximation Algorithms for. 1996 , volume =

    1996

  229. [239]

    Hochbaum , title =

    Dorit S. Hochbaum , title =. Journal of Algorithms , year =

  230. [240]

    Woeginger , title =

    Gerhard J. Woeginger , title =. ICALP , year =

  231. [241]

    Discrete Applied Mathematics , year =

    Chandra Chekuri and Rajeev Motwani , title =. Discrete Applied Mathematics , year =

  232. [242]

    Extremal Graph Theory , journal =

    Bela Bollob\'. Extremal Graph Theory , journal =. 1995 , volume =

    1995

  233. [243]

    In Svante Carlsson Andrzej Lingas, Rolf G

    Carsten Lund and Mihalis Yannakakis , title =. In Svante Carlsson Andrzej Lingas, Rolf G. Karlsson, editor, Automata, Languages and Programming, 20th International Colloquium, volume 700 of Lecture Notes in Computer Science , year =

  234. [244]

    STOC , year =

    Uriel Feige , title =. STOC , year =

  235. [245]

    Simon , title =

    Hans U. Simon , title =. SIAM J. Algebraic Discrete Methods , year =

  236. [246]

    Sivakumar , title =

    D. Sivakumar , title =. STOC , year =

  237. [247]

    SODA , year =

    Lars Engebretsen and Piotr Indyk and Ryan O'Donnell , title =. SODA , year =

  238. [248]

    Henning Fernau and Rolf Niedermeier , title =. J. Algorithms , year =

  239. [249]

    Eran Halperin and Ram Nathaniel and Uri Zwick , title =. Math. Programming , year =

  240. [250]

    SODA , year =

    Eran Halperin and Ram Nathaniel and Uri Zwick , title =. SODA , year =

  241. [251]

    Karger and Rajeev Motwani and Madhu Sudan , title =

    David R. Karger and Rajeev Motwani and Madhu Sudan , title =. JACM , year =

  242. [252]

    1968 , volume =

    William Feller , title =. 1968 , volume =

    1968

  243. [253]

    Probability Theory , year =

    Alfr. Probability Theory , year =

  244. [254]

    Johnson , title =

    David S. Johnson , title =. Journal of Algorithms , year =

  245. [255]

    Garey and David S

    Michael R. Garey and David S. Johnson , title =. 1979 , volume =

    1979

  246. [256]

    On decompositions of graphs , journal =

    L\'. On decompositions of graphs , journal =. 1966 , volume =

    1966

  247. [257]

    The ellipsoid method and its consequences in combinatorial optimization , journal =

    Martin Gr\". The ellipsoid method and its consequences in combinatorial optimization , journal =. 1981 , volume =

    1981

  248. [258]

    Geometric Algorithms and Combinatorial Optimization , journal =

    Martin Gr\". Geometric Algorithms and Combinatorial Optimization , journal =. 1988 , volume =

    1988

  249. [259]

    SODA , year =

    Eran Halperin , title =. SODA , year =

  250. [260]

    Acta Inform

    Burkhard Monien and Ewald Speckenmeyer , title =. Acta Inform. , year =

  251. [261]

    Reuven Bar-Yehuda and Shimon Even , title =. Ann. Discrete Math. , year =

Pith tools

Reviewed June 25, 2026 · model on record in the stance chip above.