Lisa Fleischer

4.5k total citations
56 papers, 2.2k citations indexed

About

Lisa Fleischer is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Lisa Fleischer has authored 56 papers receiving a total of 2.2k indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 24 papers in Computer Networks and Communications and 14 papers in Management Science and Operations Research. Recurrent topics in Lisa Fleischer's work include Complexity and Algorithms in Graphs (28 papers), Optimization and Search Problems (20 papers) and Advanced Graph Theory Research (18 papers). Lisa Fleischer is often cited by papers focused on Complexity and Algorithms in Graphs (28 papers), Optimization and Search Problems (20 papers) and Advanced Graph Theory Research (18 papers). Lisa Fleischer collaborates with scholars based in United States, Germany and United Kingdom. Lisa Fleischer's co-authors include Satoru Iwata, Satoru Fujishige, Kamal Jain, Éva Tardos, Jonathan W. Berry, William E. Hart, Cynthia A. Phillips, Martin Skutella, Jean‐Paul Watson and Mohammad Mahdian and has published in prestigious journals such as SHILAP Revista de lepidopterología, Operations Research and Journal of the ACM.

In The Last Decade

Lisa Fleischer

55 papers receiving 2.0k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Lisa Fleischer United States 25 821 685 406 336 263 56 2.2k
Michael Patriksson Sweden 31 290 0.4× 656 1.0× 407 1.0× 164 0.5× 300 1.1× 117 3.8k
Jeff Linderoth United States 24 587 0.7× 593 0.9× 457 1.1× 260 0.8× 512 1.9× 71 2.6k
Arie Tamir Israel 28 680 0.8× 817 1.2× 345 0.8× 155 0.5× 1.0k 3.9× 119 2.7k
Patrice Marcotte Canada 29 217 0.3× 1.1k 1.5× 490 1.2× 317 0.9× 463 1.8× 77 4.1k
Michel Minoux France 24 655 0.8× 848 1.2× 456 1.1× 356 1.1× 1.1k 4.1× 105 3.0k
John Hooker United States 33 1.0k 1.2× 906 1.3× 473 1.2× 931 2.8× 1.5k 5.6× 110 3.7k
John J. Jarvis United States 11 433 0.5× 290 0.4× 419 1.0× 180 0.5× 470 1.8× 25 2.2k
Daniel Vanderpooten France 25 316 0.4× 1.1k 1.6× 865 2.1× 540 1.6× 434 1.7× 78 2.6k
John E. Mitchell United States 26 234 0.3× 365 0.5× 193 0.5× 99 0.3× 324 1.2× 91 2.1k
Pravin Varaiya United States 17 537 0.7× 491 0.7× 216 0.5× 423 1.3× 42 0.2× 47 2.2k

Countries citing papers authored by Lisa Fleischer

Since Specialization
Citations

This map shows the geographic impact of Lisa Fleischer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Lisa Fleischer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lisa Fleischer more than expected).

Fields of papers citing papers by Lisa Fleischer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Lisa Fleischer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Lisa Fleischer. The network helps show where Lisa Fleischer may publish in the future.

Co-authorship network of co-authors of Lisa Fleischer

This figure shows the co-authorship network connecting the top 25 collaborators of Lisa Fleischer. A scholar is included among the top collaborators of Lisa Fleischer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Lisa Fleischer. Lisa Fleischer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Fleischer, Lisa, Ruth Esser, Steven R. Talbot, et al.. (2025). Combination of targeted pharmacotherapy and immunotherapy with anti‐CD19 CAR NK cells in acute lymphoblastic leukemia. HemaSphere. 9(10). e70238–e70238.
2.
Bhaskar, Umang, et al.. (2014). On the Uniqueness of Equilibrium in Atomic Splittable Routing Games. Mathematics of Operations Research. 40(3). 634–654. 5 indexed citations
3.
Azar, Yossi, Umang Bhaskar, Lisa Fleischer, & Debmalya Panigrahi. (2013). Online mixed packing and covering. arXiv (Cornell University). 85–100. 18 indexed citations
4.
Bhaskar, Umang, Lisa Fleischer, & Elliot Anshelevich. (2011). A Stackelberg strategy for routing flow over time. arXiv (Cornell University). 92. 192–201. 2 indexed citations
5.
Svitkina, Zoya & Lisa Fleischer. (2011). Submodular Approximation: Sampling-based Algorithms and Lower Bounds. SIAM Journal on Computing. 40(6). 1715–1737. 49 indexed citations
6.
Bhaskar, Umang, et al.. (2009). Equilibria of atomic flow games are not unique. Symposium on Discrete Algorithms. 748–757. 22 indexed citations
7.
Bhaskar, Umang, et al.. (2009). Equilibria of Atomic Flow Games are not Unique. 748–757. 10 indexed citations
8.
Svitkina, Zoya & Lisa Fleischer. (2008). Submodular Approximation: Sampling-based Algorithms and Lower Bounds. 697–706. 12 indexed citations
9.
Coppersmith, Don, Lisa Fleischer, & Atri Rudra. (2006). Ordering by weighted number of wins gives a good ranking for weighted tournaments. Symposium on Discrete Algorithms. 776–782. 74 indexed citations
10.
Fleischer, Lisa, Kamal Jain, & David P. Williamson. (2006). Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. Journal of Computer and System Sciences. 72(5). 838–867. 61 indexed citations
11.
Fleischer, Lisa, Michel X. Goemans, Vahab Mirrokni, & Maxim Sviridenko. (2006). Tight approximation algorithms for maximum general assignment problems. 611–620. 103 indexed citations
12.
Fleischer, Lisa. (2005). Linear tolls suffice: New bounds and algorithms for tolls in single source networks. Theoretical Computer Science. 348(2-3). 217–225. 25 indexed citations
13.
Fleischer, Lisa, William E. Hart, Jean‐Paul Watson, Cynthia A. Phillips, & Jonathan W. Berry. (2004). Sensor placement in municipal water networks.. 11 indexed citations
14.
Fleischer, Lisa. (2004). A fast approximation scheme for fractional covering problems with variable upper bounds. Symposium on Discrete Algorithms. 1001–1010. 16 indexed citations
15.
Fleischer, Lisa & Jay Sethuraman. (2003). Approximately optimal control of fluid networks. Symposium on Discrete Algorithms. 56–65. 7 indexed citations
16.
Fleischer, Lisa & Satoru Iwata. (2003). A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Applied Mathematics. 131(2). 311–322. 54 indexed citations
17.
Fleischer, Lisa & Martin Skutella. (2002). Minimum Cost Flows Over Time without Intermediate Storage. DepositOnce. 66–75. 9 indexed citations
18.
Fleischer, Lisa, Satoru Iwata, & S. Thomas McCormick. (2002). A faster capacity scaling algorithm for minimum cost submodular flow. Mathematical Programming. 92(1). 119–139. 13 indexed citations
19.
Fleischer, Lisa & James B. Orlin. (2000). Optimal Rounding of Instantaneous Fractional Flows Over Time. SIAM Journal on Discrete Mathematics. 13(2). 145–153. 2 indexed citations
20.
Wayne, Kevin & Lisa Fleischer. (1999). Faster approximation algorithms for generalized flow. Symposium on Discrete Algorithms. 981–982. 13 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026