このEditionに反映済みのmain full research papersのみ掲載しています。著者リンクは日本の大学への著者別所属根拠がある場合に限ります。
2024 · ICALP
Optimal Electrical Oblivious Routing on ExpandersCella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Optimal Non-Adaptive Cell Probe Dictionaries and HashingKasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Optimal PSPACE-Hardness of Approximating Set Cover ReconfigurationShuichi Hirahara, Naoto Ohsaka
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Oracle Separation of QMA and QCMA with Bounded AdaptivityShalev Ben-David, Srijita Kundu
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Oracle-Augmented Prophet InequalitiesSariel Har-Peled, Elfarouk Harb, Vasilis Livanos
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Parameterized Algorithms for Coordinated Motion Planning: Minimizing EnergyArgyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Parameterized Algorithms for Steiner Forest in Bounded Width GraphsAndreas Emil Feldmann, Michael Lampis
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Parameterized Approximation For Robust Clustering in Discrete Geometric SpacesFateme Abbasi, Sandip Banerjee, Jarosław Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Path-Reporting Distance Oracles with Logarithmic Stretch and Linear SizeShiri Chechik, Tianyi Zhang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Polylogarithmic Approximations for Robust s-t PathShi Li, Chenyang Xu, Ruilong Zhang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex CoverFlorent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Problems on Group-Labeled Matroid BasesFlorian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz
Algorithms & Complexity
日本大学: 東京大学
2024 · ICALP
Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing ProblemsSerge Gaspers, Jerry Zirui Li
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Random Separating Hyperplane Theorem and Learning PolytopesChiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Refuting Approaches to the Log-Rank Conjecture for XOR FunctionsHamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Regular Expressions with Backreferences and Lookaheads Capture NLOGYuya Uezato
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Robot Positioning Using Torus Packing for MultisetsChung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global ConstraintsTanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Separability in Büchi VASS and Singly Non-Linear Systems of InequalitiesPascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Sharp Noisy Binary Search with Monotonic ProbabilitiesLucas Gretta, Eric Price
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Simultaneously Approximating All 𝓁_p-Norms in Correlation ClusteringSami Davies, Benjamin Moseley, Heather Newman
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Smoothed Analysis of Deterministic Discounted and Mean-Payoff GamesBruno Loff, Mateusz Skomra
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Solution Discovery via Reconfiguration for Problems in PMario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Solving Promise Equations over Monoids and GroupsAlberto Larrauri, Stanislav Živný
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Solving Woeginger’s Hiking Problem: Wonderful Partitions in Anonymous Hedonic GamesAndrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Splitting-Off in HypergraphsKristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Streaming Algorithms for Connectivity AugmentationCe Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Streaming Edge Coloring with Asymptotically Optimal ColorsMohammad Saneian, Soheil Behnezhad
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Streaming Edge Coloring with Subquadratic Palette SizeShiri Chechik, Doron Mukhtar, Tianyi Zhang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete ClassificationEsther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Sublinear Algorithms for TSP via Path CoversSoheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Subquadratic Submodular Maximization with a General Matroid ConstraintYusuke Kobayashi, Tatsuya Terao
Algorithms & Complexity
日本大学: 京都大学
2024 · ICALP
T-Rex: Termination of Recursive Functions Using Lexicographic Linear CombinationsRaphael Douglas Giles, Vincent Jackson, Christine Rizkallah
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Testing C_k-Freeness in Bounded-Arboricity GraphsTalya Eden, Reut Levi, Dana Ron
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Testing Spreading Behavior in Networks with Arbitrary TopologiesAugusto Modanese, Yuichi Yoshida
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
The 2-Dimensional Constraint Loop Problem Is DecidableQuentin Guilmant, Engel Lefaucheux, Joël Ouaknine, James Worrell
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
The Bit Complexity of Dynamic Algebraic Formulas and Their DeterminantsEmile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
The Complexity of Computing in Continuous Time: Space Complexity Is PrecisionManon Blanc, Olivier Bournez
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
The Discrepancy of Shortest PathsGreg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
The Group Access Bounds for Binary Search TreesParinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
The Structure of Trees in the Pushdown HierarchyArnaud Carayol, Lucien Charamond
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
The Threshold Problem for Hypergeometric Sequences with Quadratic ParametersGeorge Kenison
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5Sophia Heimann, Hung P. Hoang, Stefan Hougardy
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Tight Bounds on Adjacency Labels for Monotone Graph ClassesÉdouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix ParametersCarla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Paweł Rzążewski
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Towards an Analysis of Quadratic ProbingWilliam Kuszmaul, Zoe Xi
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Two Choices Are Enough for P-LCPs, USOs, and Colorful TangentsMichaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Two-Sets Cut-Uncut on Planar GraphsMatthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Two-Source and Affine Non-Malleable Extractors for Small EntropyXin Li, Yan Zhong
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Verification of Population Protocols with Unordered DataSteffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Vertex-Minor Universal Graphs for Generating Entangled Quantum SubsystemsMaxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Vital Edges for (s,t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity OraclesSurender Baswana, Koustav Bhanja
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2024 · ICALP
Õptimal Dynamic Time Warping on Run-Length Encoded StringsItai Boneh, Shay Golan, Shay Mozes, Oren Weimann
Algorithms & Complexity
日本大学: 関与なし(対象大学)