Movatterモバイル変換

[0]ホーム
URL:

×

zbMATH Open — the first resource for mathematics

from until
Reset all

Examples

Simon Donald*Search inall parts of an author's name (results containSimon, Donald M. andDonaldson,Simon Kirwan).
ln: Donald* fn: SimonSearch for specified family (ln) and given (fn) name.
au: Stefan Müller cc:49Combine name search (au) with main MSC fields (cc).
au: Helga BunkeSearch results includename variations, in particularname changes, differenttransliterations andpseudonyms. Names of collectives will be displayed as a separate entity.
(st:r & b) | (st:o)Search results include allreviewers withbiographic information orcollectives.
(en:MGP | wikidata) ln:a*Search results include all authors having either anentry in theMath Genealogy Project or inWikidata and whose family name starts with''A''.
aw: Fields AbelSearch for allFields Medalaward winners who also received anAbel Prize. The& operator is default and ommitted here.

Fields

ai zbMATH author ID
any Includes ai, au, aw, cc
au Author name
aw Name of an award (to find laureates)
cc Main Fields of the author (given by first two MSC digits)
cm Name of a collective (to find members of this collective)
co Name of an author (to find collectives the author is a member of)
en External author ID: ORCID, MGP, Wikidata object number and others
fn First name
ln Last name
py Year(s) in which the author has published. Interval search with “-”
rv Reviewer ID
st State: has biographic references (st:b), is cited (st:c), is collective (st:o), has references (st:r)

Operators

a & bLogical and (default)
a | bLogical or
!abLogical not
abc*Right wildcard
ab cPhrase
(ab c)Term grouping

See also ourGeneral Help.



Li, Jason

Co-Author Distance
Author ID:
li.jason.1 Recent zbMATH articles by "Li, Jason"
Published as:
Li, Jason
Documents Indexed:

35 Publications since 2012

Publications by Year

Citations contained in zbMATH Open

30 Publications have been cited 245 times in169 DocumentsCited by ▼Year ▼
An FPT algorithm beating 2-approximation for \(k\)-cut. Zbl 1403.68350
Gupta, Anupam;Lee, Euiwoong;Li, Jason
2018
On the fixed-parameter tractability of capacitated clustering. Zbl 1552.68395
Cohen-Addad, Vincent;Li, Jason
2019
Tight FPT approximations for \(k\)-median and \(k\)-means. Zbl 1552.68394
Cohen-Addad, Vincent;Gupta, Anupam;Kumar, Amit;Lee, Euiwoong;Li, Jason
2019
Improved distributed algorithms for exact shortest paths. Zbl 1428.68379
Ghaffari, Mohsen;Li, Jason
2018
Minor excluded network families admit fast distributed algorithms. Zbl 1428.68382
Haeupler, Bernhard;Li, Jason;Zuzic, Goran
2018
Losing treewidth by separating subsets. Zbl 1432.68355
Gupta, Anupam;Lee, Euiwoong;Li, Jason;Manurangsi, Pasin;Włodarczyk, Michał
2019
Detecting feedback vertex sets of size \(k\) in \(O^*(2.7^k)\) time. Zbl 1547.68622
Li, Jason;Nederlof, Jesper
2020
New distributed algorithms in almost mixing time via transformations from parallel algorithms. Zbl 1508.68411
Ghaffari, Mohsen;Li, Jason
2018
Faster distributed shortest path approximations via shortcuts. Zbl 1502.68363
Haeupler, Bernhard;Li, Jason
2018
Planar diameter via metric compression. Zbl 1433.68301
Li, Jason;Parter, Merav
2019
The Karger-Stein algorithm is optimal for k-cut. Zbl 07298263
Gupta, Anupam;Lee, Euiwoong;Li, Jason
2020
Lower central series of a free associative algebra over the integers and finite fields. Zbl 1320.16012
Bhupatiraju, Surya;Etingof, Pavel;Jordan, David;Kuszmaul, William;Li, Jason
2012
Faster parallel algorithm for approximate shortest path. Zbl 07298250
Li, Jason
2020
The number of minimum \(k\)-cuts: improving the Karger-Stein bound. Zbl 1437.05222
Gupta, Anupam;Lee, Euiwoong;Li, Jason
2019
Vertex connectivity in poly-logarithmic max-flows. Zbl 07765174
Li, Jason;Nanongkai, Danupon;Panigrahi, Debmalya;Saranurak, Thatchaphol;Yingchareonthawornchai, Sorrachai
2021
Undirected \((1+\varepsilon)\)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. Zbl 07774354
Rozhoň, Václav;Grunau, Christoph;Haeupler, Bernhard;Zuzic, Goran;Li, Jason
2022
Optimal bounds for the \(k\)-cut problem. Zbl 1547.68609
Gupta, Anupam;Harris, David G.;Lee, Euiwoong;Li, Jason
2022
Matroid-based TSP rounding for half-integral solutions. Zbl 1497.90173
Gupta, Anupam;Lee, Euiwoong;Li, Jason;Mucha, Marcin;Newman, Heather;Sarkar, Sherry
2022
The connectivity threshold for dense graphs. Zbl 07788345
Gupta, Anupam;Lee, Euiwoong;Li, Jason
2021
A quasipolynomial \((2+\varepsilon)\)-approximation for planar sparsest cut. Zbl 07765231
Cohen-Addad, Vincent;Gupta, Anupam;Klein, Philip N.;Li, Jason
2021
Augmenting edge connectivity via isolating cuts. Zbl 07883708
Cen, Ruoxu;Li, Jason;Panigrahi, Debmalya
2021
Detecting feedback vertex sets of size \(k\) in \(O^\star (2.7^k)\) time. Zbl 1547.68623
Li, Jason;Nederlof, Jesper
2022
Approximate Gomory-Hu tree is faster than \(n-1\) max-flows. Zbl 07765283
Li, Jason;Panigrahi, Debmalya
2021
Deterministic mincut in almost-linear time. Zbl 07765179
Li, Jason
2021
A local search-based approach for set covering. Zbl 07848485
Gupta, Anupam;Lee, Euiwoong;Li, Jason
2023
Near-linear time approximations for cut problems via fair cuts. Zbl 07847970
Li, Jason;Nanongkai, Danupon;Panigrahi, Debmalya;Saranurak, Thatchaphol
2023
Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows. Zbl 07848055
Cen, Ruoxu;He, William;Li, Jason;Panigrahi, Debmalya
2023
Near-linear-time, optimal vertex cut sparsifiers in directed acyclic graphs. Zbl 07740907
He, Zhiyang;Li, Jason;Wahlström, Magnus
2021
Beyond the quadratic time barrier for network unreliability. Zbl 07951135
Cen, Ruoxu;He, William;Li, Jason;Panigrahi, Debmalya
2024
Deterministic near-linear time minimum cut in weighted graphs. Zbl 07951184
Henzinger, Monika;Li, Jason;Rao, Satish;Wang, Di
2024
Beyond the quadratic time barrier for network unreliability. Zbl 07951135
Cen, Ruoxu;He, William;Li, Jason;Panigrahi, Debmalya
2024
Deterministic near-linear time minimum cut in weighted graphs. Zbl 07951184
Henzinger, Monika;Li, Jason;Rao, Satish;Wang, Di
2024
A local search-based approach for set covering. Zbl 07848485
Gupta, Anupam;Lee, Euiwoong;Li, Jason
2023
Near-linear time approximations for cut problems via fair cuts. Zbl 07847970
Li, Jason;Nanongkai, Danupon;Panigrahi, Debmalya;Saranurak, Thatchaphol
2023
Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows. Zbl 07848055
Cen, Ruoxu;He, William;Li, Jason;Panigrahi, Debmalya
2023
Undirected \((1+\varepsilon)\)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. Zbl 07774354
Rozhoň, Václav;Grunau, Christoph;Haeupler, Bernhard;Zuzic, Goran;Li, Jason
2022
Optimal bounds for the \(k\)-cut problem. Zbl 1547.68609
Gupta, Anupam;Harris, David G.;Lee, Euiwoong;Li, Jason
2022
Matroid-based TSP rounding for half-integral solutions. Zbl 1497.90173
Gupta, Anupam;Lee, Euiwoong;Li, Jason;Mucha, Marcin;Newman, Heather;Sarkar, Sherry
2022
Detecting feedback vertex sets of size \(k\) in \(O^\star (2.7^k)\) time. Zbl 1547.68623
Li, Jason;Nederlof, Jesper
2022
Vertex connectivity in poly-logarithmic max-flows. Zbl 07765174
Li, Jason;Nanongkai, Danupon;Panigrahi, Debmalya;Saranurak, Thatchaphol;Yingchareonthawornchai, Sorrachai
2021
The connectivity threshold for dense graphs. Zbl 07788345
Gupta, Anupam;Lee, Euiwoong;Li, Jason
2021
A quasipolynomial \((2+\varepsilon)\)-approximation for planar sparsest cut. Zbl 07765231
Cohen-Addad, Vincent;Gupta, Anupam;Klein, Philip N.;Li, Jason
2021
Augmenting edge connectivity via isolating cuts. Zbl 07883708
Cen, Ruoxu;Li, Jason;Panigrahi, Debmalya
2021
Approximate Gomory-Hu tree is faster than \(n-1\) max-flows. Zbl 07765283
Li, Jason;Panigrahi, Debmalya
2021
Deterministic mincut in almost-linear time. Zbl 07765179
Li, Jason
2021
Near-linear-time, optimal vertex cut sparsifiers in directed acyclic graphs. Zbl 07740907
He, Zhiyang;Li, Jason;Wahlström, Magnus
2021
Detecting feedback vertex sets of size \(k\) in \(O^*(2.7^k)\) time. Zbl 1547.68622
Li, Jason;Nederlof, Jesper
2020
The Karger-Stein algorithm is optimal for k-cut. Zbl 07298263
Gupta, Anupam;Lee, Euiwoong;Li, Jason
2020
Faster parallel algorithm for approximate shortest path. Zbl 07298250
Li, Jason
2020
On the fixed-parameter tractability of capacitated clustering. Zbl 1552.68395
Cohen-Addad, Vincent;Li, Jason
2019
Tight FPT approximations for \(k\)-median and \(k\)-means. Zbl 1552.68394
Cohen-Addad, Vincent;Gupta, Anupam;Kumar, Amit;Lee, Euiwoong;Li, Jason
2019
Losing treewidth by separating subsets. Zbl 1432.68355
Gupta, Anupam;Lee, Euiwoong;Li, Jason;Manurangsi, Pasin;Włodarczyk, Michał
2019
Planar diameter via metric compression. Zbl 1433.68301
Li, Jason;Parter, Merav
2019
The number of minimum \(k\)-cuts: improving the Karger-Stein bound. Zbl 1437.05222
Gupta, Anupam;Lee, Euiwoong;Li, Jason
2019
An FPT algorithm beating 2-approximation for \(k\)-cut. Zbl 1403.68350
Gupta, Anupam;Lee, Euiwoong;Li, Jason
2018
Improved distributed algorithms for exact shortest paths. Zbl 1428.68379
Ghaffari, Mohsen;Li, Jason
2018
Minor excluded network families admit fast distributed algorithms. Zbl 1428.68382
Haeupler, Bernhard;Li, Jason;Zuzic, Goran
2018
New distributed algorithms in almost mixing time via transformations from parallel algorithms. Zbl 1508.68411
Ghaffari, Mohsen;Li, Jason
2018
Faster distributed shortest path approximations via shortcuts. Zbl 1502.68363
Haeupler, Bernhard;Li, Jason
2018
Lower central series of a free associative algebra over the integers and finite fields. Zbl 1320.16012
Bhupatiraju, Surya;Etingof, Pavel;Jordan, David;Kuszmaul, William;Li, Jason
2012
alltop 5

Cited by 286 Authors

11 Saurabh, Saket
8 Censor-Hillel, Keren
7 Chandrasekaran, Karthekeyan
7 Cohen-Addad, Vincent
7 Haeupler, Bernhard
7 Li, Jason
6 Chang, Yi-Jun
6 Fomin, Fedor V.
6 Krasilnikov, Alexei N.
6 Lee, Euiwoong
6 Leitersdorf, Dean
6 Zuzic, Goran
5 Golovach, Petr A.
5 Manurangsi, Pasin
5 Nanongkai, Danupon
5 Parter, Merav
4 Deryabina, Galina
4 Dory, Michal
4 Feng, Qilong
4 Ghaffari, Mohsen
4 Jansen, Bart M. P.
4 Kim, Eunjung
4 Panolan, Fahad
4 Purohit, Nidhi
4 Saranurak, Thatchaphol
4 Scheideler, Christian
4 Werthmann, Julian
4 Włodarczyk, Michał
4 Zhang, Zhen
3 Chekuri, Chandra S.
3 de Vos, Tijn
3 Forster, Sebastian
3 Inamdar, Tanmay C.
3 Izumi, Taisuke
3 Kanesh, Lawqueen
3 Klein, Nathan
3 Lokshtanov, Daniel
3 Paz, Ami
3 Quanrud, Kent
3 Wang, Jianxin
3 Wang, Weihang
3 Xu, Chao
3 Xu, Jinhui
3 Xu, Yicheng
3 Zehavi, Meirav
3 Zhang, Yong
2 Ahn, Jungho
2 Bandyapadhyay, Sayan
2 Beideman, Calvin
2 Bernstein, Aaron
2 Blažej, Václav
2 Byrka, Jarosław
2 Cao, Nairen
2 Chechik, Shiri
2 Choudhary, Pratibha
2 Coy, Sam
2 Czumaj, Artur
2 de Kroon, Jari J. H.
2 Elkin, Michael
2 Fineman, Jeremy T.
2 Fischer, Orr
2 Götte, Thorsten
2 Gowda, Kishen N.
2 Goyal, Dishant
2 Grunau, Christoph
2 Gupta, Anupam
2 Huang, Xiaohui
2 Jaiswal, Ragesh
2 Jana, Satyabrata
2 Jin, Billy
2 Joret, Gwenaël
2 Knop, Dušan
2 Kobayashi, Yusuke
2 Kong, Xiangyan
2 Korhonen, Janne H.
2 Křišt’an, Jan Matyáš
2 Le Gall, François
2 Lenzen, Christoph
2 Levi, Reut
2 Liu, Pengcheng
2 Lonkar, Aditya
2 Maity, Soumen
2 Marcinkowski, Jan
2 Medina, Moti
2 Mömke, Tobias
2 Mukhopadhyay, Sagnik
2 Mukhtar, Doron
2 Muluk, Komal
2 Neiman, Ofer
2 Oshman, Rotem
2 Otachi, Yota
2 Panigrahi, Debmalya
2 Patel, Vraj
2 Ravid, Noam
2 Ron, Dana
2 Rozhoň, Václav
2 Russell, Katina
2 Saha, Souvik
2 Sahu, Abhishek
2 Saulpic, David
...and 186 more Authors
alltop 5

Cited in 32 Serials

13 Theoretical Computer Science
12 Distributed Computing
6 Algorithmica
6 Mathematical Programming. Series A. Series B
5 SIAM Journal on Computing
4 Information Processing Letters
4 Journal of Algebra
3 Combinatorica
3 SIAM Journal on Discrete Mathematics
3 Theory of Computing Systems
3 ACM Transactions on Algorithms
2 Discrete Mathematics
2 Journal of Computer and System Sciences
2 International Journal of Algebra and Computation
2 Discrete Optimization
1 Communications in Algebra
1 Discrete Applied Mathematics
1 Information Sciences
1 Mathematics of Operations Research
1 Networks
1 Operations Research Letters
1 Mathematical Structures in Computer Science
1 Combinatorics, Probability and Computing
1 Journal of Combinatorial Optimization
1 Optimization and Engineering
1 Journal of Algebra and its Applications
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 Electronic Journal of Statistics
1 Algorithms
1 Mathematical Programming Computation
1 Theory of Computing
1 TheoretiCS

Citations by Year

© 2025FIZ Karlsruhe GmbHPrivacy PolicyLegal NoticesTerms & Conditions
  • Mastodon logo
 (opens in new tab)
[8]ページ先頭
©2009-2025 Movatter.jp