Towards Unification of Algorithmic Tools

Información del proyecto

TUgbOAT

Identificador del acuerdo de subvención: 772346

DOI

10.3030/772346

Proyecto cerrado

Fecha de la firma de la CE 6 Marzo 2018

Fecha de inicio 1 Septiembre 2018

Fecha de finalización 31 Agosto 2024

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 510 800,00

Aportación de la UE

€ 1 510 800,00

Coordinado por

UNIWERSYTET WARSZAWSKI
Poland

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Book chapters (12)

Planar Reachability Under Single Vertex or Edge Failures

Autores: Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 2739-2758, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.163

Exact Shortest Paths with Rational Weights on the Word RAM

Autores: Adam Karczmarz, Wojciech Nadara, Marek Sokołowski
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Página(s) 2597-2608
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.92

Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs

Autores: Adam Karczmarz, Jakub Łącki
Publicado en: Symposium on Simplicity in Algorithms, 2020, Página(s) 106-120, ISBN 978-1-61197-601-4
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976014.15

Internal Quasiperiod Queries

Autores: Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba
Publicado en: String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13–15, 2020, Proceedings, Edición 12303, 2020, Página(s) 60-75, ISBN 978-3-030-59211-0
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-59212-7_5

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours

Autores: François Dross, Krzysztof Fleszar, Karol Węgrzycki, Anna Zych-Pawlewicz
Publicado en: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, Página(s) 1433-1463
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch52

Max <i>s</i>, <i>t</i>-Flow Oracles and Negative Cycle Detection in Planar Digraphs

Autores: Adam Karczmarz
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Página(s) 1606-1620
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.64

Drawing Graphs on Few Lines and Few Planes

Autores: Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
Publicado en: Lecture Notes in Computer Science, Graph Drawing and Network Visualization, 2020, Página(s) 166-180
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-50106-2_14

The Parameterized Complexity of the Survivable Network Design Problem

Autores: Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
Publicado en: Symposium on Simplicity in Algorithms (SOSA), 2022, Página(s) 37-56
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977066.4

Shortest Disjoint Paths on a Grid

Autores: Mathieu Mari, Anish Mukherjee, Piotr Sankowski
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Página(s) 346-365
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.14

(1 + <i>∊</i>)-Approximate Incremental Matching in Constant Deterministic Amortized Time

Autores: Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn,, Shay Solomon
Publicado en: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Página(s) 1886-1898
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.114

A Deterministic Parallel APSP Algorithm and its Applications

Autores: Adam Karczmarz, Piotr Sankowski
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 255-272, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.17

Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths

Autores: Adam Karczmarz
Publicado en: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Página(s) 154-172
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977073.8

Other (7)

Analyzing the Influence of Language Model-Generated Responses in Mitigating Hate Speech on Social Media Directed at Ukrainian Refugees in Poland

Autores: Podolak, Jakub; Łukasik, Szymon; Balawender, Paweł; Ossowski, Jan; Bąkowicz, Katarzyna; Sankowski, Piotr
Publicado en: Edición 5, 2024
Editor: arXiv
DOI: 10.48550/arxiv.2311.16905

On price-induced minmax matchings

Autores: Dürr, Christoph; Mari, Mathieu; Schmidt-Kraepelin, Ulrike
Publicado en: 2023, Edición 15, 2023
Editor: arXiv
DOI: 10.48550/arxiv.2302.11902

A parameterized approximation scheme for the 2D-Knapsack problem with wide items

Autores: Mari, Mathieu; Picavet, Timothe; Pilipczuk, Michał
Publicado en: 2023, Edición 4, 2023
Editor: arXiv
DOI: 10.48550/arxiv.2307.10672

Contrastive News and Social Media Linking using BERT for Articles and Tweets across Dual Platforms

Autores: Piotrowski, Jan; Wachnicki, Marek; Perlik, Mateusz; Podolak, Jakub; Rucki, Grzegorz; Brzozowski, Michał; Olejnik, Paweł; Kozłowski, Julian; Nocoń, Tomasz; Kozieł, Jakub; Giziński, Stanisław; Sankowski, Piotr
Publicado en: Edición 1, 2024
Editor: arXiv

Reachability and Matching in Single Crossing Minor Free Graphs

Autores: Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Publicado en: 2021
Editor: arXiv

Dynamic complexity of Reachability: How many changes can we handle?

Autores: Datta, Samir; Kumar, Pankaj; Mukherjee, Anish; Tawari, Anuj; Vortmeier, Nils; Zeume, Thomas
Publicado en: Edición 1, 2020
Editor: arXiv
DOI: 10.48550/arxiv.2004.12739

Decomposable Submodular Function Minimization via Maximum Flow

Autores: Axiotis, Kyriakos; Karczmarz, Adam; Mukherjee, Anish; Sankowski, Piotr; Vladu, Adrian
Publicado en: Edición 2, 2020
Editor: arXiv

Conference proceedings (17)

Walking randomly, massively, and efficiently

Autores: Jakub Łącki, Slobodan Mitrović, Krzysztof Onak, Piotr Sankowski
Publicado en: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Página(s) 364-377, ISBN 9781450369794
Editor: ACM
DOI: 10.1145/3357713.3384303

Deterministic Fully Dynamic SSSP and More

Autores: Jan Van Den Brand, Adam Karczmarz
Publicado en: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Página(s) 2312-2321
Editor: IEEE
DOI: 10.1109/focs57990.2023.00142

Multi-level Aggregation with Delays and Stochastic Arrivals

Autores: Mathieu Mari, Michaŀ Pawŀowski, Runtian Ren, Piotr Sankowski
Publicado en: AAMAS '24: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024
Editor: ACM

Dynamic Complexity of Reachability: How Many Changes Can We Handle?

Autores: Datta, Samir; Kumar, Pankaj; Mukherjee, Anish; Tawari, Anuj; Vortmeier, Nils; Zeume, Thomas
Publicado en: Edición 1, 2020
Editor: LIPIcs
DOI: 10.4230/lipics.icalp.2020.122

Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form

Autores: Adam Karczmarz, Piotr Sankowski
Publicado en: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Página(s) 1745-1756
Editor: IEEE
DOI: 10.1109/focs57990.2023.00106

Dynamic PageRank: Algorithms and Lower Bounds

Autores: Rajesh Jayaram, Jakub Łącki, Slobodan Mitrović, Krzysztof Onak, Piotr Sankowski
Publicado en: 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), 2024
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2024.90

Decomposable Submodular Function Minimization via Maximum Flow

Autores: Axiotis, Kyriakos; Karczmarz, Adam; Mukherjee, Anish; Sankowski, Piotr; Vladu, Adrian
Publicado en: Proceedings of the 38th International Conference on Machine Learning (ICML2021), Edición 14, 2021
Editor: PMLR
DOI: 10.48550/arxiv.2103.03868

Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs

Autores: Adam Karczmarz, Jakub Łacki
Publicado en: 2019
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2019.65

(1 + ε)-Approximate incremental matching in constant deterministic amortized time

Autores: Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon
Publicado en: 2019
Editor: Society for Industrial and Applied Mathematics

Min-Cost Flow in Unit-Capacity Planar Graphs

Autores: Adam Karczmarz, Piotr Sankowski
Publicado en: 2019
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2019.66

Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems

Autores: Karczmarz, Adam
Publicado en: n 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)., Edición 5, 2021
Editor: Schloss Dagstuhl Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2106.11744

Reachability and Matching in Single Crossing Minor Free Graphs

Autores: Datta, Samir; Gupta, Chetan; Jain, Rahul; Mukherjee, Anish; Sharma, Vimalraj; Tewari, Raghunath
Publicado en: In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), Edición 1, 2021
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2103.13940

Online matching with delays and stochastic arrival times

Autores: Mari, Mathieu; Pawłowski, Michał; Ren, Runtian; Sankowski, Piotr
Publicado en: AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, Edición 5, 2023
Editor: ACM
DOI: 10.48550/arxiv.2210.07018

A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items

Autores: Mari, Mathieu; Picavet, Timothé; Pilipczuk, Michał
Publicado en: In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), Edición 25, 2023
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.ipec.2023.33

Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs

Autores: Karczmarz, Adam; Pawlewicz, Jakub; Sankowski, Piotr
Publicado en: SoCG, Edición 1, 2021
Editor: LIPIcs

Subquadratic dynamic path reporting in directed graphs against an adaptive adversary

Autores: Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
Publicado en: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2023, Página(s) 1643-1656
Editor: ACM
DOI: 10.1145/3519935.3520058

Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs

Autores: Charalampopoulos, Panagiotis ; Karczmarz, Adam
Publicado en: 28th Annual European Symposium on Algorithms (ESA 2020), 2020
Editor: LIPIcs
DOI: 10.4230/lipics.esa.2020.31

Peer reviewed articles (8)

Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b -matching, and Unweighted f -factors

Autores: Harold N. Gabow, Piotr Sankowski
Publicado en: SIAM Journal on Computing, Edición 50/2, 2021, Página(s) 440-486, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1106195

Frameworks for designing in-place graph algorithms

Autores: Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
Publicado en: Journal of Computer and System Sciences, Edición 123, 2021, Página(s) 1-19, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1016/j.jcss.2021.07.004

An Improved Algorithm for Online Min-Sum Set Cover

Autores: Marcin Bienkowski, Marcin Mucha
Publicado en: Proceedings of the AAAI Conference on Artificial Intelligence, Edición 37, 2023, Página(s) 6815-6822, ISSN 2374-3468
Editor: AAAI
DOI: 10.1609/aaai.v37i6.25835

Drawing graphs on few lines and few planes

Autores: Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
Publicado en: Journal of Computational Geometry, 2021, ISSN 1920-180X
Editor: Carleton University
DOI: 10.20382/jocg.v11i1a17

Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf

Autores: Karczmarz, Adam; Mukherjee, Anish; Sankowski, Piotr; Wygocki, Piotr
Publicado en: Proceedings of the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, Edición 1, 2022, ISSN 2640-3498
Editor: JMLR
DOI: 10.48550/arxiv.2108.04126

Dynamic Meta-theorems for Distance and Matching

Autores: Datta, Samir; Gupta, Chetan; Jain, Rahul; Mukherjee, Anish; Sharma, Vimal Raj; Tewari, Raghunath
Publicado en: In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Edición 5, 2022, ISSN 1868-8969
Editor: Schloss Dagstuhl Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2109.01875

Minimum rectilinear polygons for given angle sequences

Autores: William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Publicado en: Computational Geometry, Edición 100, 2023, Página(s) 101820, ISSN 0925-7721
Editor: Elsevier BV
DOI: 10.1016/j.comgeo.2021.101820

Algorithms for Weighted Matching Generalizations II: f -factors and the Special Case of Shortest Paths

Autores: Harold N. Gabow, Piotr Sankowski
Publicado en: SIAM Journal on Computing, Edición 50/2, 2021, Página(s) 555-601, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1106225