ICALP - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 4606

2023

Parameter Estimation for Gibbs DistributionsDavid G. Harris 0001, Vladimir Kolmogorov. icalp 2023: [doi]

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by TreewidthMichal Wlodarczyk 0001. icalp 2023: [doi]

Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling ProblemsShi Li 0001. icalp 2023: [doi]

The Identity Problem in ℤ ≀ ℤ Is DecidableRuiwen Dong 0001. icalp 2023: [doi]

The Skolem Landscape (Invited Talk)James Worrell 0001. icalp 2023: [doi]

Context-Bounded Analysis of Concurrent Programs (Invited Talk)Pascal Baumann 0001, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche. icalp 2023: [doi]

Checking Refinement of Asynchronous Programs Against Context-Free SpecificationsPascal Baumann 0001, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche. icalp 2023: [doi]

An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed GraphsPan Peng 0001, Yuyang Wang. icalp 2023: [doi]

Matching Augmentation via Simultaneous ContractionsMohit Garg 0003, Felix Hommelsheim, Nicole Megow. icalp 2023: [doi]

Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General MetricsYu Chen 0039, Sanjeev Khanna, Zihan Tan. icalp 2023: [doi]

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

On Range Summary QueriesPeyman Afshani, Pingan Cheng, Aniket Basu Roy, Zhewei Wei. icalp 2023: [doi]

Stable Matching: Choosing Which Proposals to MakeIshan Agarwal, Richard Cole 0001. icalp 2023: [doi]

Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut PlayerDaniel Agassy, Dani Dorfman, Haim Kaplan. icalp 2023: [doi]

Locality in Online, Dynamic, Sequential, and Distributed Graph AlgorithmsAmirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi, Jukka Suomela. icalp 2023: [doi]

An Efficient Algorithm for All-Pairs Bounded Edge ConnectivityShyan Akmal, Ce Jin. icalp 2023: [doi]

Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-MultilinearizationPrashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha 0001, Bhargav Thankey. icalp 2023: [doi]

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative SetsIlan Doron Arad, Ariel Kulik, Hadas Shachnai. icalp 2023: [doi]

Multi Layer Peeling for Linear Arrangement and Hierarchical ClusteringYossi Azar, Danny Vainstein. icalp 2023: [doi]

Robust Communication Complexity of Matching: EDCS Achieves 5/6 ApproximationAmir Azarmehr, Soheil Behnezhad. icalp 2023: [doi]

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable FunctionsIshan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur. icalp 2023: [doi]

Cumulative Memory Lower Bounds for Randomized and Quantum ComputationPaul Beame, Niels Kornerup. icalp 2023: [doi]

On the Limits of Decision: the Adjacent Fragment of First-Order LogicBartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann. icalp 2023: [doi]

Dynamic Averaging Load Balancing on Arbitrary GraphsPetra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser, Malin Rau. icalp 2023: [doi]

Fast Approximation of Search Trees on Trees with Centroid TreesBenjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma 0002. icalp 2023: [doi]

A Dichotomy for Succinct Representations of HomomorphismsChristoph Berkholz, Harry Vinall-Smeeth. icalp 2023: [doi]

Sublinear Time Eigenvalue Approximation via Random SamplingRajarshi Bhattacharjee, Gregory Dexter, Petros Drineas, Cameron Musco, Archan Ray. icalp 2023: [doi]

Streaming k-Edit Approximate Pattern Matching via String DecompositionSudatta Bhattacharya, Michal Koucký 0001. icalp 2023: [doi]

On Computing the Vertex Connectivity of 1-Plane GraphsTherese Biedl, Karthik Murali. icalp 2023: [doi]

The Geometry of Tree-Based SortingGuy E. Blelloch, Magdalen Dobson. icalp 2023: [doi]

Population Protocols with Unordered DataMichael Blondin, François Ladouceur. icalp 2023: [doi]

Network Satisfaction Problems Solved by k-ConsistencyManuel Bodirsky, Simon Knäuer. icalp 2023: [doi]

Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related ParametersHans L. Bodlaender, Carla Groenland, Michal Pilipczuk. icalp 2023: [doi]

Nondeterministic Interactive Refutations for Nearest Boolean VectorAndrej Bogdanov, Alon Rosen. icalp 2023: [doi]

Algebraic Recognition of Regular FunctionsMikolaj Bojanczyk, Lê Thành Dung Nguyên. icalp 2023: [doi]

How to Play Optimally for Regular Objectives?Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove. icalp 2023: [doi]

Monadic NIP in Monotone Classes of Relational StructuresSamuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos. icalp 2023: [doi]

Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant ViewpointJin-yi Cai, Ben Young. icalp 2023: [doi]

A 4/3 Approximation for 2-Vertex-ConnectivityMiguel Bosch Calvo, Fabrizio Grandoni 0001, Afrouz Jabal Ameli. icalp 2023: [doi]

Deterministic Regular Functions of Infinite WordsOlivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot, Sarah Winter. icalp 2023: [doi]

Characterising Memory in Infinite GamesAntonio Casares, Pierre Ohlmann. icalp 2023: [doi]

On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small kTimothy M. Chan, Qizheng He, Yuancheng Yu. icalp 2023: [doi]

Ortho-Radial Drawing in Near-Linear TimeYi-Jun Chang. icalp 2023: [doi]

Quantum Algorithms and Lower Bounds for Linear Regression with Norm ConstraintsYanlin Chen, Ronald de Wolf. icalp 2023: [doi]

Approximate Nearest Neighbor for Polygonal Curves Under Fréchet DistanceSiu-Wing Cheng, Haoqiang Huang. icalp 2023: [doi]

A General Framework for Learning-Augmented Online AllocationIlan Reuven Cohen, Debmalya Panigrahi. icalp 2023: [doi]

New Partitioning Techniques and Faster Algorithms for Approximate Interval SchedulingSpencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld. icalp 2023: [doi]

Minimum Chain Cover in Almost Linear TimeManuel Cáceres. icalp 2023: [doi]

Incremental Maximization via ContinuizationYann Disser, Max Klimm, Kevin Schewior, David Weckbecker. icalp 2023: [doi]

Local Computation Algorithms for Hypergraph Coloring - Following Beck's ApproachAndrzej Dorobisz, Jakub Kozik. icalp 2023: [doi]

Indiscernibles and Flatness in Monadically Stable and Monadically NIP ClassesJan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk. icalp 2023: [doi]

Connected k-Center and k-Diameter ClusteringLukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt 0001, Julian Wargalla. icalp 2023: [doi]

On Sparsification of Stochastic Packing ProblemsShaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel. icalp 2023: [doi]

Protecting Single-Hop Radio Networks from Message DropsKlim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena. icalp 2023: [doi]

Broadcasting with Random MatricesCharilaos Efthymiou, Kostas Zampetakis. icalp 2023: [doi]

On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n, d/n)Charilaos Efthymiou, Weiming Feng 0001. icalp 2023: [doi]

50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, GermanyKousha Etessami, Uriel Feige, Gabriele Puppis, editors, Volume 261 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product ProblemsAusten Z. Fan, Paraschos Koutris, Hangdong Zhao. icalp 2023: [doi]

Truthful Matching with Online Items and Offline AgentsMichal Feldman, Federico Fusco, Simon Mauras, Rebecca Reiffenhäuser. icalp 2023: [doi]

Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper BoundsRobert Ferens, Marek Szykula. icalp 2023: [doi]

An O(log k)-Approximation for Directed Steiner Tree in Planar GraphsZachary Friggstad, Ramin Mousavi. icalp 2023: [doi]

Flipper Games for Monadically Stable Graph ClassesJakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk. icalp 2023: [doi]

Quantum Cryptography with Classical Communication: Parallel Remote State Preparation for Copy-Protection, Verification, and MoreAlexandru Gheorghiu, Tony Metger, Alexander Poremba. icalp 2023: [doi]

Parameterised and Fine-Grained Subgraph Counting, Modulo 2Leslie Ann Goldberg, Marc Roth. icalp 2023: [doi]

Efficient Data Structures for Incremental Exact and Approximate Maximum FlowGramoz Goranci, Monika Henzinger. icalp 2023: [doi]

Low Sample Complexity Participatory BudgetingMohak Goyal, Sukolsak Sakshuwong, Sahasrajit Sarmasarkar, Ashish Goel. icalp 2023: [doi]

The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-AssemblyDaniel Hader, Matthew J. Patitz. icalp 2023: [doi]

On Finding Constrained Independent Sets in CyclesIshay Haviv. icalp 2023: [doi]

Regular Methods for Operator Precedence LanguagesThomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi, N. Ege Saraç. icalp 2023: [doi]

Faster Submodular Maximization for Several Classes of MatroidsMonika Henzinger, Paul Liu, Jan Vondrák, Da-Wei Zheng. icalp 2023: [doi]

Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite PlanarPetr Hlinený, Jan Jedelský. icalp 2023: [doi]

Ellipsoid Fitting up to a ConstantJun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, Jeff Xu. icalp 2023: [doi]

Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL AlgorithmJun-Ting Hsieh, Pravesh K. Kothari. icalp 2023: [doi]

Finding Almost Tight Witness TreesDylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità. icalp 2023: [doi]

Efficient Caching with Reserves via MarkingSharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang. icalp 2023: [doi]

Rerouting Planar Curves and Disjoint PathsTakehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki. icalp 2023: [doi]

Hardness of Finding Combinatorial Shortest Paths on Graph AssociahedraTakehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto. icalp 2023: [doi]

Searching for Regularity in Bounded FunctionsSiddharth Iyer, Michael Whitmeyer. icalp 2023: [doi]

A (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem (Invited Talk)Anna R. Karlin. icalp 2023: [doi]

New Additive EmulatorsShimon Kogan, Merav Parter. icalp 2023: [doi]

An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk)Rasmus Kyng. icalp 2023: [doi]

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional OptimalityMarvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki. icalp 2023: [doi]

First Order Logic on Pathwidth Revisited AgainMichael Lampis. icalp 2023: [doi]

Simulating Markovian Open Quantum Systems Using Higher-Order Series ExpansionXiantao Li, Chunhao Wang. icalp 2023: [doi]

On the Complexity of Diameter and Related Problems in Permutation GroupsMarkus Lohrey, Andreas Rosowski. icalp 2023: [doi]

Online Demand Scheduling with FailoversKonstantina Mellou, Marco Molinaro 0001, Rudy Zhou. icalp 2023: [doi]

Faster Parameterized Algorithms for Modification Problems to Minor-Closed ClassesLaure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. icalp 2023: [doi]

Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph ClassesPierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk. icalp 2023: [doi]

Nearly Tight Spectral Sparsification of Directed HypergraphsKazusato Oko, Shinsaku Sakaue, Shin-ichi Tanigawa. icalp 2023: [doi]

The Communication Complexity of Set Intersection Under Product DistributionsRotem Oshman, Tal Roth. icalp 2023: [doi]

Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled StatesMinglong Qin, Penghui Yao. icalp 2023: [doi]

Lasserre Hierarchy for Graph Isomorphism and Homomorphism IndistinguishabilityDavid E. Roberson, Tim Seppelt. icalp 2023: [doi]

Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and ComplexityWojciech Rozowski, Tobias Kappé, Dexter Kozen, Todd Schmid, Alexandra Silva 0001. icalp 2023: [doi]

Average-Case to (Shifted) Worst-Case Reduction for the Trace Reconstruction ProblemIttai Rubinstein. icalp 2023: [doi]

The Support of Open Versus Closed Random WalksThomas Sauerwald, He Sun 0001, Danny Vagnozzi. icalp 2023: [doi]

Sample-Based Distance-Approximation for Subsequence-FreenessOmer Cohen Sidon, Dana Ron. icalp 2023: [doi]

Faster Matroid Partition AlgorithmsTatsuya Terao. icalp 2023: [doi]

Frameworks for Nonclairvoyant Network Design with Deadlines or DelayNoam Touitou. icalp 2023: [doi]

Quantum Codes, Local Testability and Interactive Proofs: State of the Art and Open Questions (Invited Talk)Thomas Vidick. icalp 2023: [doi]

The Wrong Direction of Jensen's Inequality Is Algorithmically RightOr Zamir. icalp 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

ICALP (icalp)

Viewing Publication 1 - 100 from 4606

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

ICALP (icalp)

Viewing Publication 1 - 100 from 4606

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