ESA - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 2084

2023

Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix MultiplicationDavid G. Harris 0001. esa 2023: [doi]

Canonization of a Random Graph by Two Matrix-Vector MultiplicationsOleg Verbitsky 0001, Maksim Zhukovskii 0001. esa 2023: [doi]

Improved Algorithms for Distance Selection and Related ProblemsHaitao Wang 0001, Yiming Zhao. esa 2023: [doi]

Enumerating Maximal Induced SubgraphsYixin Cao 0001. esa 2023: [doi]

Algorithms for Computing Maximum Cliques in Hyperbolic Random GraphsEunjin Oh 0001, Seunghyeok Oh. esa 2023: [doi]

Threshold Testing and Semi-Online Prophet InequalitiesMartin Hoefer 0001, Kevin Schewior. esa 2023: [doi]

Simple Deterministic Approximation for Submodular Multiple Knapsack ProblemXiaoming Sun 0001, Jialin Zhang 0001, Zhijie Zhang. esa 2023: [doi]

Efficient 1-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing SequencesMing Ding 0005, Peng Zhang 0052. esa 2023: [doi]

Front Matter, Table of Contents, Preface, Conference Organizationesa 2023: [doi]

What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?Amir Abboud, Shay Mozes, Oren Weimann. esa 2023: [doi]

Can You Solve Closest String Faster Than Exhaustive Search?Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier. esa 2023: [doi]

Smooth Distance ApproximationAhmed Abdelkader, David M. Mount. esa 2023: [doi]

Reconfiguration of Polygonal Subdivisions via RecombinationHugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tóth, Thomas Weighill. esa 2023: [doi]

Faster Detours in Undirected GraphsShyan Akmal, Virginia Vassilevska Williams, Ryan Williams 0001, Zixuan Xu. esa 2023: [doi]

A Local-To-Global Theorem for Congested Shortest PathsShyan Akmal, Nicole Wein. esa 2023: [doi]

Axis-Parallel Right Angle Crossing GraphsPatrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann 0001, Maximilian Pfister 0002, Torsten Ueckerdt. esa 2023: [doi]

(No) Quantum Space-Time Tradeoff for USTCONSimon Apers, Stacey Jeffery, Galina Pass, Michael Walter 0005. esa 2023: [doi]

Exploration of Graphs with Excluded MinorsJúlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer. esa 2023: [doi]

Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere ElseEvripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris. esa 2023: [doi]

Lyndon Arrays in Sublinear TimeHideo Bannai, Jonas Ellert. esa 2023: [doi]

Sorting Finite Automata via Partition RefinementRuben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza. esa 2023: [doi]

Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix MultiplicationMatthias Bentert, Klaus Heeger, Tomohiro Koana. esa 2023: [doi]

Approximating Min-Diameter: Standard and BichromaticAaron Berger, Jenny Kaufmann, Virginia Vassilevska Williams. esa 2023: [doi]

Space-Efficient Parameterized Algorithms on Graphs of Low ShrubdepthBenjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen. esa 2023: [doi]

High Performance Construction of RecSplit Based Minimal Perfect Hash FunctionsDominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders 0001. esa 2023: [doi]

Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update TimeJoakim Blikstad, Peter Kiss. esa 2023: [doi]

On the Giant Component of Geometric Inhomogeneous Random GraphsThomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Janosch Ruff, Ziena Zeif. esa 2023: [doi]

An Efficient Algorithm for Power Dominating SetThomas Bläsius, Max Göttlicher. esa 2023: [doi]

Faster 0-1-Knapsack via Near-Convex Min-Plus-ConvolutionKarl Bringmann, Alejandro Cassis. esa 2023: [doi]

Funnelselect: Cache-Oblivious Multiple SelectionGerth Stølting Brodal, Sebastian Wild. esa 2023: [doi]

Oriented SpannersKevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov 0001, Carolin Rehs, André van Renssen, Sampson Wong. esa 2023: [doi]

Online Coalition Formation Under Random Arrival or Coalition DissolutionMartin Bullinger, René Romen. esa 2023: [doi]

On k-Means for Segments and PolylinesSergio Cabello, Panos Giannopoulos. esa 2023: [doi]

Effective Resistances in Non-Expander GraphsDongrun Cai, Xue Chen, Pan Peng 0001. esa 2023: [doi]

New Menger-Like Dualities in Digraphs and Applications to Half-Integral LinkagesVictor A. Campos, Jonas Costa, Raul Lopes 0001, Ignasi Sau. esa 2023: [doi]

Approximation Algorithm for Norm Multiway CutCharlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan. esa 2023: [doi]

Faster Local Motif Clustering via Maximum FlowsAdil Chhabra, Marcelo Fonseca Faraj, Christian Schulz 0003. esa 2023: [doi]

Primal-Dual Schemes for Online Matching in Bounded Degree GraphsIlan Reuven Cohen, Binghui Peng. esa 2023: [doi]

Robust and Space-Efficient Dual Adversary Quantum Query AlgorithmsMichael Czekanski, Shelby Kimmel, R. Teal Witter. esa 2023: [doi]

Revisiting the Random Subset Sum ProblemArthur Carvalho Walraven da Cunha, Francesco D'Amore 0001, Frédéric Giroire, Hicham Lesfari, Emanuele Natale, Laurent Viennot. esa 2023: [doi]

Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious SettingsChristoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang 0001. esa 2023: [doi]

A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of DepotsMax Deppert, Matthias Kaul, Matthias Mnich. esa 2023: [doi]

On Hashing by (Random) Equations (Invited Talk)Martin Dietzfelbinger. esa 2023: [doi]

Efficient Parallel Output-Sensitive Edit DistanceXiangyun Ding, Xiaojun Dong 0001, Yan Gu 0001, Youzhe Liu, Yihan Sun 0001. esa 2023: [doi]

Optimal Energetic Paths for Electric CarsDani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick. esa 2023: [doi]

Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and BeyondJan Dreier, Daniel Mock, Peter Rossmanith. esa 2023: [doi]

Online Algorithms with Randomly Infused AdviceYuval Emek, Yuval Gil, Maciej Pacut, Stefan Schmid 0001. esa 2023: [doi]

The Lawn Mowing Problem: From Algebra to AlgorithmsSándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, Christian Scheffer. esa 2023: [doi]

Learned Monotone Minimal Perfect HashingPaolo Ferragina, Hans-Peter Lehmann, Peter Sanders 0001, Giorgio Vinciguerra. esa 2023: [doi]

Correlating Theory and Practice in Finding Clubs and PlexesAleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche. esa 2023: [doi]

Bootstrapping Dynamic Distance OraclesSebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos. esa 2023: [doi]

A Sweep-Plane Algorithm for Calculating the Isolation of MountainsDaniel Funke, Nicolai Hüning, Peter Sanders 0001. esa 2023: [doi]

A Tight Competitive Ratio for Online Submodular Welfare MaximizationAmit Ganz, Pranav Nuti, Roy Schwartz 0002. esa 2023: [doi]

First Order Logic and Twin-Width in TournamentsColin Geniet, Stéphan Thomassé. esa 2023: [doi]

Improved Approximation Algorithms for the Expanding Search ProblemSvenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior. esa 2023: [doi]

Noisy k-Means++ RevisitedChristoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon. esa 2023: [doi]

31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The NetherlandsInge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman, editors, Volume 274 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree PackingElfarouk Harb, Kent Quanrud, Chandra Chekuri. esa 2023: [doi]

Tight Algorithms for Connectivity Problems Parameterized by Clique-WidthFalko Hegerfeld, Stefan Kratsch. esa 2023: [doi]

Pareto Sums of Pareto SetsDemian Hespe, Peter Sanders 0001, Sabine Storandt, Carina Truschel. esa 2023: [doi]

Solving Edge Clique Cover Exactly via Synergistic Data ReductionAnthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, Johnathan Wilson. esa 2023: [doi]

Improved Quantum BoostingAdam Izdebski, Ronald de Wolf. esa 2023: [doi]

Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is LargeAshwin Jacob, Michal Wlodarczyk 0001, Meirav Zehavi. esa 2023: [doi]

5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution SizeBart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk 0001. esa 2023: [doi]

The Unweighted and Weighted Reverse Shortest Path Problem for Disk GraphsHaim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir. esa 2023: [doi]

On Fully Dynamic Strongly Connected ComponentsAdam Karczmarz, Marcin Smulewicz. esa 2023: [doi]

An Improved Approximation Algorithm for the Max-3-Section ProblemDor Katzelnick, Aditya Pillai, Roy Schwartz 0002, Mohit Singh. esa 2023: [doi]

Fitting Tree Metrics with Minimum DisagreementsEvangelos Kipouridis. esa 2023: [doi]

Coloring Tournaments with Few Colors: Algorithms and ComplexityFelix Klingelhöfer, Alantha Newman. esa 2023: [doi]

Bellman-Ford Is Optimal for Shortest Hop-Bounded PathsTomasz Kociumaka, Adam Polak 0001. esa 2023: [doi]

Towards Bypassing Lower Bounds for Graph ShortcutsShimon Kogan, Merav Parter. esa 2023: [doi]

Connectivity Queries Under Vertex Failures: Not Optimal, but PracticalEvangelos Kosinas. esa 2023: [doi]

Improved Approximations for Translational Packing of Convex PolygonsAdam Kurpisz, Silvan Suter. esa 2023: [doi]

Faster Block Tree ConstructionDominik Köppl, Florian Kurpicz, Daniel Meyer. esa 2023: [doi]

Structural Parameterizations for Two Bounded Degree Problems RevisitedMichael Lampis, Manolis Vasilakis. esa 2023: [doi]

Massively Parallel Algorithms for the Stochastic Block ModelZelin Li, Pan Peng 0001, Xianbin Zhu 0002. esa 2023: [doi]

Connectivity in the Presence of an OpponentZihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao. esa 2023: [doi]

On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite MatchingJingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang 0001, Renfei Zhou. esa 2023: [doi]

Tight Bounds for Quantum Phase Estimation and Related ProblemsNikhil S. Mande, Ronald de Wolf. esa 2023: [doi]

A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and CutwidthIsja Mannens, Jesper Nederlof. esa 2023: [doi]

Matching Statistics Speed up BWT ConstructionFrancesco Masillo. esa 2023: [doi]

Approximation Schemes for Min-Sum k-ClusteringIsmail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour. esa 2023: [doi]

Parameterized Complexity of Equality MinCSPGeorge Osipov, Magnus Wahlström. esa 2023: [doi]

Engineering Fast Algorithms for the Bottleneck Matching ProblemIoannis Panagiotas, Grégoire Pichon, Somesh Singh 0001, Bora Uçar. esa 2023: [doi]

Subcubic Algorithm for (Unweighted) Unrooted Tree Edit DistanceKrzysztof Pióro. esa 2023: [doi]

Linear Time Construction of Cover Suffix Tree and ApplicationsJakub Radoszewski. esa 2023: [doi]

Simultaneous Representation of Interval Graphs in the Sunflower CaseIgnaz Rutter, Peter Stumpf. esa 2023: [doi]

Relaxed Models for Adversarial Streaming: The Bounded Interruptions Model and the Advice ModelMenachem Sadigurschi, Moshe Shechner, Uri Stemmer. esa 2023: [doi]

Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small kThatchaphol Saranurak, Wuwei Yuan. esa 2023: [doi]

Approximating Connected Maximum Cuts via Local SearchBaruch Schieber, Soroush Vahidi. esa 2023: [doi]

Parameterized Matroid-Constrained Maximum CoverageFrançois Sellier. esa 2023: [doi]

Fault Tolerance in Euclidean Committee SelectionChinmay Sonar, Subhash Suri, Jie Xue 0003. esa 2023: [doi]

Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat MapsJacek Sroka, Jerzy Tyszkiewicz. esa 2023: [doi]

Improved Algorithms for Online Rent Minimization Problem Under Unit-Size JobsEnze Sun, Zonghan Yang, Yuhao Zhang 0001. esa 2023: [doi]

The Tight Spanning Ratio of the Rectangle Delaunay TriangulationAndré van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong. esa 2023: [doi]

Maximum Coverage in Random-Arrival StreamsRowan Warneke, Farhana Murtaza Choudhury, Anthony Wirth. esa 2023: [doi]

Efficient Block Approximate Matrix MultiplicationChuhan Yang, Christopher Musco. esa 2023: [doi]

A Simple Boosting Framework for TransshipmentGoran Zuzic. esa 2023: [doi]

Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek. esa 2023: [doi]

Counting and Sampling Labeled Chordal Graphs in Polynomial TimeÚrsula Hébert-Johnson, Daniel Lokshtanov, Eric Vigoda. esa 2023: [doi]

Links

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1

ESA (esa)

Viewing Publication 1 - 100 from 2084

2023

Links

Filter by Year [-]OR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top terms [+]OR AND NOT 1

ESA (esa)

Viewing Publication 1 - 100 from 2084

2023

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1