| 2026 | ESA | Improved Bounds for Strategy Improvement Algorithms for Energy Games. | Dani Dorfman, Haim Kaplan, Uri Zwick |
| 2026 | ESA | Streaming with Catalytic Memory. | Tamara Kaplan, Nimrod Kaplan, Haim Kaplan |
| 2026 | ICALP | Improved Tree Sparsifiers in Near-Linear Time. | Daniel Agassy, Dani Dorfman, Haim Kaplan |
| 2025 | FOCS | A Little Clairvoyance Is All You Need. | Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlter, Sorrachai Yingchareonthawornchai |
| 2025 | ICALP | Faster All-Pairs Optimal Electric Car Routing. | Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick |
| 2025 | ICALP | Minimizing Recourse in an Adaptive Balls and Bins Game. | Adi Fine, Haim Kaplan, Uri Stemmer |
| 2025 | ICML | Nearly Optimal Sample Complexity for Learning with Label Proportions. | Rbert Istvan Busa-Fekete, Travis Dick, Claudio Gentile, Haim Kaplan, Tomer Koren, Uri Stemmer |
| 2025 | STOC | On Differentially Private Linear Algebra. | Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer, Nitzan Tur |
| 2024 | ESA | Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments. | Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir |
| 2024 | ICALP | Caching Connections in Matchings. | Yaniv Sadeh, Haim Kaplan |
| 2023 | ESA | Optimal Energetic Paths for Electric Cars. | Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick |
| 2023 | ESA | The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. | Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir |
| 2023 | ICALP | Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. | Daniel Agassy, Dani Dorfman, Haim Kaplan |
| 2023 | ICALP | Fast Approximation of Search Trees on Trees with Centroid Trees. | Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, Lszl Kozma |
| 2023 | ICML | Concurrent Shuffle Differential Privacy Under Continual Observation. | Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer |
| 2023 | SODA | Almost Tight Bounds for Online Facility Location in the Random-Order Model. | Haim Kaplan, David Naori, Danny Raz |
| 2023 | STACS | Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. | Yaniv Sadeh, Haim Kaplan |
| 2022 | COLT | Monotone Learning. | Olivier Bousquet, Amit Daniely, Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer |
| 2022 | ICML | Differentially Private Approximate Quantiles. | Haim Kaplan, Shachar Schnapp, Uri Stemmer |
| 2022 | ICML | FriendlyCore: Practical Differentially Private Aggregation. | Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer |
| 2022 | INFOCOM | Minimal Total Deviation in TCAM Load Balancing. | Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan |
| 2022 | ISIT | Coding Size of Traffic Partition in Switch Memories. | Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan |
| 2022 | SODA | Online Weighted Matching with a Sample. | Haim Kaplan, David Naori, Danny Raz |
| 2022 | SODA | Simulating a stack using queues. | Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick |
| 2022 | STOC | Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. | Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer |
| 2021 | COLT | Online Markov Decision Processes with Aggregate Bandit Feedback. | Alon Cohen, Haim Kaplan, Tomer Koren, Yishay Mansour |
| 2021 | COLT | The Sparse Vector Technique, Revisited. | Haim Kaplan, Yishay Mansour, Uri Stemmer |
| 2021 | CRYPTO | Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model. | Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer |
| 2021 | ICML | Differentially-Private Clustering of Easy Instances. | Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia |
| 2021 | STACS | Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. | Haim Kaplan, Jay Tenenbaum |
| 2020 | AAAI | Apprenticeship Learning via Frank-Wolfe. | Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour |
| 2020 | ALT | Thompson Sampling for Adversarial Bit Prediction. | Yuval Lewi, Haim Kaplan, Yishay Mansour |
| 2020 | ALT | Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. | Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour |
| 2020 | COLT | Privately Learning Thresholds: Closing the Exponential Gap. | Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer |
| 2020 | CoNEXT | Optimal approximations for traffic distribution in bounded switch memories. | Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan |
| 2020 | ICML | Near-optimal Regret Bounds for Stochastic Shortest Path. | Aviv Rosenberg, Alon Cohen, Yishay Mansour, Haim Kaplan |
| 2020 | SODA | Competitive Analysis with a Sample and the Secretary Problem. | Haim Kaplan, David Naori, Danny Raz |
| 2020 | UAI | Unknown mixing times in apprenticeship and reinforcement learning. | Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour |
| 2019 | ESA | Triangles and Girth in Disk Graphs and Transmission Graphs. | Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir |
| 2019 | ICALP | A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. | Dani Dorfman, Haim Kaplan, Uri Zwick |
| 2019 | ICML | Differentially Private Learning of Geometric Concepts. | Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer |
| 2019 | INFOCOM | Optimal Representations of a Traffic Distribution in Switch Memories. | Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan |
| 2019 | SODA | Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. | Haim Kaplan, Lszl Kozma, Or Zamir, Uri Zwick |
| 2019 | SODA | A sort of an adversary. | Haim Kaplan, Or Zamir, Uri Zwick |
| 2019 | STOC | Faster | Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick |
| 2018 | AAAI | Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. | Edith Cohen, Shiri Chechik, Haim Kaplan |
| 2018 | ESA | Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. | Dani Dorfman, Haim Kaplan, Lszl Kozma, Seth Pettie, Uri Zwick |
| 2018 | ICALP | Union of Hypercubes and 3D Minkowski Sums with Random Sizes. | Pankaj K. Agarwal, Haim Kaplan, Micha Sharir |
| 2018 | ISAAC | Approximate Minimum-Weight Matching with Outliers Under Translation. | Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Gnter Rote, Micha Sharir, Allen Xiao |
| 2018 | ISAAC | Stabbing Pairwise Intersecting Disks by Five Points. | Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert |
| 2018 | MFCS | Pairing heaps: the forward variant. | Dani Dorfman, Haim Kaplan, Lszl Kozma, Uri Zwick |
| 2018 | SODA | Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic | Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann |
| 2018 | SPAA | Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. | Haim Kaplan, Shay Solomon |
| 2018 | SPAA | Accurate Traffic Splitting on Commodity Switches. | Ori Rottenstreich, Yossi Kanizo, Haim Kaplan, Jennifer Rexford |
| 2017 | ESA | Output Sensitive Algorithms for Approximate Incidences and Their Applications. | Dror Aiger, Haim Kaplan, Micha Sharir |
| 2017 | ESA | Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. | Haim Kaplan, Sasanka Roy, Micha Sharir |
| 2017 | ESA | Clustering in Hypergraphs to Minimize Average Edge Service Time. | Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim |
| 2017 | SODA | Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. | Yossi Azar, Ashish Chiplunkar, Haim Kaplan |
| 2017 | SODA | (1 + ∊)-Approximate | Shiri Chechik, Sarel Cohen, Amos Fiat, Haim Kaplan |
| 2017 | SODA | Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. | Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir |
| 2016 | LATIN | Routing in Unit Disk Graphs. | Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth |
| 2016 | SODA | Approximating the | Sariel Har-Peled, Haim Kaplan, Micha Sharir |
| 2016 | STACS | Bottleneck Paths and Trees and Deterministic Graphical Games. | Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick |
| 2015 | ESA | The Temp Secretary Problem. | Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov |
| 2015 | ESA | Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. | Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck |
| 2015 | ICALP | Hollow Heaps. | Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick |
| 2015 | MFCS | On the Complexity of Hub Labeling (Extended Abstract). | Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller |
| 2015 | SODA | The amortized cost of finding the minimum. | Haim Kaplan, Or Zamir, Uri Zwick |
| 2015 | STOC | Adjacency Labeling Schemes and Induced-Universal Graphs. | Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick |
| 2015 | STACS | Minimum Cost Flows in Graphs with Unit Capacities. | Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan |
| 2014 | SODA | Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. | Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick |
| 2013 | INFOCOM | On finding an optimal TCAM encoding scheme for packet classification. | Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat |
| 2013 | MFCS | Minimal Indices for Successor Search - (Extended Abstract). | Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan |
| 2013 | SODA | Computing the Discrete Frchet Distance in Subquadratic Time. | Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir |
| 2013 | SODA | Reporting neighbors in high-dimensional Euclidean spaces. | Dror Aiger, Haim Kaplan, Micha Sharir |
| 2013 | WADS | Joint Cache Partition and Job Assignment on Multi-core Processors. | Avinatan Hassidim, Haim Kaplan, Omry Tuval |
| 2012 | INFOCOM | Upward Max Min Fairness. | Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov |
| 2012 | INFOCOM | How to split a flow? | Tzvika Hartman, Avinatan Hassidim, Haim Kaplan, Danny Raz, Michal Segalov |
| 2012 | SODA | Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. | Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir |
| 2011 | ESA | Maximum Flows by Incremental Breadth-First Search. | Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2011 | PODS | Get the most out of your sample: optimal unbiased estimators using partial information. | Edith Cohen, Haim Kaplan |
| 2011 | STACS | Minimum s-t cut in undirected planar graphs when the source and the sink are close. | Haim Kaplan, Yahav Nussbaum |
| 2010 | ESA | Optimal Cover of Points by Disks in a Simple Polygon. | Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir |
| 2010 | FOCS | Improved Bounds for Geometric Permutations. | Natan Rubin, Haim Kaplan, Micha Sharir |
| 2009 | ESA | Maximum Flow in Directed Planar Graphs with Vertex Capacities. | Haim Kaplan, Yahav Nussbaum |
| 2009 | SODA | Stream sampling for variance-optimal estimation of subset sums. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2009 | SODA | Line transversals of convex polyhedra in | Haim Kaplan, Natan Rubin, Micha Sharir |
| 2009 | SODA | A simpler implementation and analysis of Chazelle's soft heaps. | Haim Kaplan, Uri Zwick |
| 2009 | STOC | Private coresets. | Dan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim |
| 2009 | SIGMETRICS | Leveraging discarded samples for tighter estimation of multiple-set aggregates. | Edith Cohen, Haim Kaplan |
| 2008 | ESA | Path Minima in Incremental Unrooted Trees. | Haim Kaplan, Nira Shafrir |
| 2008 | ICDM | Estimating Aggregates over Multiple Sets. | Edith Cohen, Haim Kaplan |
| 2008 | SODA | Weak ε-nets and interval chains. | Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky |
| 2007 | CPM | Most Burrows-Wheeler Based Compressors Are Not Optimal. | Haim Kaplan, Elad Verbin |
| 2007 | ESA | Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. | Haim Kaplan, Natan Rubin, Micha Sharir |
| 2007 | ICALP | Strong Price of Anarchy for Machine Load Balancing. | Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky |
| 2007 | IMC | Algorithms and estimators for accurate summarization of internet traffic. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2007 | PODC | Summarizing data using bottom-k sketches. | Edith Cohen, Haim Kaplan |
| 2007 | PODS | Sketching unaggregated data streams for subpopulation-size queries. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2007 | SODA | Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. | Yoav Giyora, Haim Kaplan |
| 2007 | SODA | Counting colors in boxes. | Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin |
| 2007 | SIGMETRICS | Bottom-k sketches: better and more efficient estimation of aggregates. | Edith Cohen, Haim Kaplan |
| 2006 | ALENEX | Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. | Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck |
| 2006 | CoNEXT | Processing top k queries from samples. | Edith Cohen, Nadav Grossaug, Haim Kaplan |
| 2006 | CPM | A Simpler Analysis of Burrows-Wheeler Based Compression. | Haim Kaplan, Shir Landau, Elad Verbin |
| 2006 | ICALP | On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. | Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo |
| 2006 | SODA | Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. | Haim Kaplan, Micha Sharir |
| 2006 | WG | Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. | Haim Kaplan, Yahav Nussbaum |
| 2005 | STOC | Learning with attribute costs. | Haim Kaplan, Eyal Kushilevitz, Yishay Mansour |
| 2005 | WADS | Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. | Giora Alexandron, Haim Kaplan, Micha Sharir |
| 2004 | SIGMOD | Spatially-decaying aggregation over a network: model and algorithms. | Edith Cohen, Haim Kaplan |
| 2004 | SODA | Efficient estimation algorithms for neighborhood variance and other moments. | Edith Cohen, Haim Kaplan |
| 2003 | CPM | Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. | Haim Kaplan, Elad Verbin |
| 2003 | FOCS | Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
| 2003 | INFOCOM | Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. | Edith Cohen, Amos Fiat, Haim Kaplan |
| 2003 | SODA | Efficient sequences of trials. | Edith Cohen, Amos Fiat, Haim Kaplan |
| 2003 | STOC | Optimal oblivious routing in polynomial time. | Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Rcke |
| 2003 | STOC | Dynamic rectangular intersection with priorities. | Haim Kaplan, Eyal Molad, Robert Endre Tarjan |
| 2002 | ESA | Partial Alphabetic Trees. | Arye Barkan, Haim Kaplan |
| 2002 | ESA | Balanced-Replication Algorithms for Distribution Trees. | Edith Cohen, Haim Kaplan |
| 2002 | IMC | Predicting and bypassing end-to-end internet service degradations. | Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour |
| 2002 | PODS | Labeling Dynamic XML Trees. | Edith Cohen, Haim Kaplan, Tova Milo |
| 2002 | SODA | Reachability and distance queries via 2-hop labels. | Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick |
| 2002 | SODA | A comparison of labeling schemes for ancestor queries. | Haim Kaplan, Tova Milo, Ronen Shabo |
| 2002 | SODA | Union-find with deletions. | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
| 2002 | STOC | Meldable heaps and boolean union-find. | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
| 2002 | SPAA | Nearest common ancestors: a survey and a new distributed algorithm. | Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe |
| 2001 | ICALP | Performance Aspects of Distributed Caches Using TTL-Based Consistency. | Edith Cohen, Eran Halperin, Haim Kaplan |
| 2001 | INFOCOM | Refreshment Policies for Web Content Caches. | Edith Cohen, Haim Kaplan |
| 2001 | PODC | Restoration by path concatenation: fast recovery of MPLS paths. | Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt |
| 2001 | SODA | Compact labeling schemes for ancestor queries. | Serge Abiteboul, Haim Kaplan, Tova Milo |
| 2001 | SODA | Making data structures confluently persistent. | Amos Fiat, Haim Kaplan |
| 2001 | SODA | Faster kinetic heaps and their use in broadcast scheduling. | Haim Kaplan, Robert Endre Tarjan, Kostas Tsioutsiouliklis |
| 2001 | SIGCOMM | Aging through cascaded caches: performance issues in the distribution of web content. | Edith Cohen, Haim Kaplan |
| 2001 | SIGMETRICS | Restoration path concatenation: fast recovery of MPLS paths. | Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt |
| 2001 | WADS | Competitive Analysis of the LRFU Paging Algorithm. | Edith Cohen, Haim Kaplan, Uri Zwick |
| 2001 | WADS | Short and Simple Labels for Small Distances and Other Functions. | Haim Kaplan, Tova Milo |
| 2000 | ICALP | Scalable Secure Storage when Half the System Is Faulty. | Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern |
| 2000 | INFOCOM | Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. | Edith Cohen, Haim Kaplan |
| 2000 | SPAA | Connection caching under vaious models of communication. | Edith Cohen, Haim Kaplan, Uri Zwick |
| 1999 | SODA | LP-based Analysis of Greedy-dual-size. | Edith Cohen, Haim Kaplan |
| 1999 | SODA | On-line Complexity of Monotone Set Systems. | Haim Kaplan, Mario Szegedy |
| 1999 | SODA | Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. | Haim Kaplan, Martin Strauss, Mario Szegedy |
| 1999 | STOC | Exploiting Regularities in Web Traffic Patterns for Cache Replacement. | Edith Cohen, Haim Kaplan |
| 1999 | STOC | Connection Caching. | Edith Cohen, Haim Kaplan, Uri Zwick |
| 1999 | STOC | Unique Maximum Matching Algorithms. | Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan |
| 1998 | STOC | Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. | Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook |
| 1998 | STACS | Cell Flipping in Permutation Diagrams. | Martin Charles Golumbic, Haim Kaplan |
| 1997 | RECOMB | Faster and simpler algorithm for sorting signed permutations by reversals. | Haim Kaplan, Ron Shamir, Robert Endre Tarjan |
| 1997 | SODA | Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. | Haim Kaplan, Ron Shamir, Robert Endre Tarjan |
| 1996 | FOCS | A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. | Sanjeev Arora, Alan M. Frieze, Haim Kaplan |
| 1996 | STOC | Purely Functional Representations of Catenable Sorted Lists. | Haim Kaplan, Robert Endre Tarjan |
| 1995 | STOC | Persistent lists with catenation via recursive slow-down. | Haim Kaplan, Robert Endre Tarjan |
| 1994 | FOCS | Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping | Haim Kaplan, Ron Shamir, Robert Endre Tarjan |
| 1993 | WG | Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). | Martin Charles Golumbic, Haim Kaplan, Ron Shamir |