Towards Unification of Algorithmic Tools

Informazioni relative al progetto

TUgbOAT

ID dell’accordo di sovvenzione: 772346

DOI

10.3030/772346

Progetto chiuso

Data della firma CE 6 Marzo 2018

Data di avvio 1 Settembre 2018

Data di completamento 31 Agosto 2024

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 1 510 800,00

Contributo UE

€ 1 510 800,00

Coordinato da

UNIWERSYTET WARSZAWSKI
Poland

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Book chapters (12)

Planar Reachability Under Single Vertex or Edge Failures

Autori: Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
Pubblicato in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Pagina/e 2739-2758, ISBN 978-1-61197-646-5
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.163

Exact Shortest Paths with Rational Weights on the Word RAM

Autori: Adam Karczmarz, Wojciech Nadara, Marek Sokołowski
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 2597-2608
Editore: 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

Autori: Adam Karczmarz, Jakub Łącki
Pubblicato in: Symposium on Simplicity in Algorithms, 2020, Pagina/e 106-120, ISBN 978-1-61197-601-4
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976014.15

Internal Quasiperiod Queries

Autori: Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba
Pubblicato in: String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13–15, 2020, Proceedings, Numero 12303, 2020, Pagina/e 60-75, ISBN 978-3-030-59211-0
Editore: 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

Autori: François Dross, Krzysztof Fleszar, Karol Węgrzycki, Anna Zych-Pawlewicz
Pubblicato in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, Pagina/e 1433-1463
Editore: 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

Autori: Adam Karczmarz
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 1606-1620
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.64

Drawing Graphs on Few Lines and Few Planes

Autori: Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
Pubblicato in: Lecture Notes in Computer Science, Graph Drawing and Network Visualization, 2020, Pagina/e 166-180
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-50106-2_14

The Parameterized Complexity of the Survivable Network Design Problem

Autori: Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
Pubblicato in: Symposium on Simplicity in Algorithms (SOSA), 2022, Pagina/e 37-56
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977066.4

Shortest Disjoint Paths on a Grid

Autori: Mathieu Mari, Anish Mukherjee, Piotr Sankowski
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 346-365
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.14

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

Autori: Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn,, Shay Solomon
Pubblicato in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Pagina/e 1886-1898
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.114

A Deterministic Parallel APSP Algorithm and its Applications

Autori: Adam Karczmarz, Piotr Sankowski
Pubblicato in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Pagina/e 255-272, ISBN 978-1-61197-646-5
Editore: 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

Autori: Adam Karczmarz
Pubblicato in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Pagina/e 154-172
Editore: 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

Autori: Podolak, Jakub; Łukasik, Szymon; Balawender, Paweł; Ossowski, Jan; Bąkowicz, Katarzyna; Sankowski, Piotr
Pubblicato in: Numero 5, 2024
Editore: arXiv
DOI: 10.48550/arxiv.2311.16905

On price-induced minmax matchings

Autori: Dürr, Christoph; Mari, Mathieu; Schmidt-Kraepelin, Ulrike
Pubblicato in: 2023, Numero 15, 2023
Editore: arXiv
DOI: 10.48550/arxiv.2302.11902

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

Autori: Mari, Mathieu; Picavet, Timothe; Pilipczuk, Michał
Pubblicato in: 2023, Numero 4, 2023
Editore: arXiv
DOI: 10.48550/arxiv.2307.10672

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

Autori: 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
Pubblicato in: Numero 1, 2024
Editore: arXiv

Reachability and Matching in Single Crossing Minor Free Graphs

Autori: Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Pubblicato in: 2021
Editore: arXiv

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

Autori: Datta, Samir; Kumar, Pankaj; Mukherjee, Anish; Tawari, Anuj; Vortmeier, Nils; Zeume, Thomas
Pubblicato in: Numero 1, 2020
Editore: arXiv
DOI: 10.48550/arxiv.2004.12739

Decomposable Submodular Function Minimization via Maximum Flow

Autori: Axiotis, Kyriakos; Karczmarz, Adam; Mukherjee, Anish; Sankowski, Piotr; Vladu, Adrian
Pubblicato in: Numero 2, 2020
Editore: arXiv

Conference proceedings (17)

Walking randomly, massively, and efficiently

Autori: Jakub Łącki, Slobodan Mitrović, Krzysztof Onak, Piotr Sankowski
Pubblicato in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Pagina/e 364-377, ISBN 9781450369794
Editore: ACM
DOI: 10.1145/3357713.3384303

Deterministic Fully Dynamic SSSP and More

Autori: Jan Van Den Brand, Adam Karczmarz
Pubblicato in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 2312-2321
Editore: IEEE
DOI: 10.1109/focs57990.2023.00142

Multi-level Aggregation with Delays and Stochastic Arrivals

Autori: Mathieu Mari, Michaŀ Pawŀowski, Runtian Ren, Piotr Sankowski
Pubblicato in: AAMAS '24: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024
Editore: ACM

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

Autori: Datta, Samir; Kumar, Pankaj; Mukherjee, Anish; Tawari, Anuj; Vortmeier, Nils; Zeume, Thomas
Pubblicato in: Numero 1, 2020
Editore: LIPIcs
DOI: 10.4230/lipics.icalp.2020.122

Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form

Autori: Adam Karczmarz, Piotr Sankowski
Pubblicato in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 1745-1756
Editore: IEEE
DOI: 10.1109/focs57990.2023.00106

Dynamic PageRank: Algorithms and Lower Bounds

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

Decomposable Submodular Function Minimization via Maximum Flow

Autori: Axiotis, Kyriakos; Karczmarz, Adam; Mukherjee, Anish; Sankowski, Piotr; Vladu, Adrian
Pubblicato in: Proceedings of the 38th International Conference on Machine Learning (ICML2021), Numero 14, 2021
Editore: PMLR
DOI: 10.48550/arxiv.2103.03868

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

Autori: Adam Karczmarz, Jakub Łacki
Pubblicato in: 2019
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2019.65

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

Autori: Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon
Pubblicato in: 2019
Editore: Society for Industrial and Applied Mathematics

Min-Cost Flow in Unit-Capacity Planar Graphs

Autori: Adam Karczmarz, Piotr Sankowski
Pubblicato in: 2019
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2019.66

Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems

Autori: Karczmarz, Adam
Pubblicato in: n 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)., Numero 5, 2021
Editore: Schloss Dagstuhl Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2106.11744

Reachability and Matching in Single Crossing Minor Free Graphs

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

Online matching with delays and stochastic arrival times

Autori: Mari, Mathieu; Pawłowski, Michał; Ren, Runtian; Sankowski, Piotr
Pubblicato in: AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, Numero 5, 2023
Editore: ACM
DOI: 10.48550/arxiv.2210.07018

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

Autori: Mari, Mathieu; Picavet, Timothé; Pilipczuk, Michał
Pubblicato in: In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), Numero 25, 2023
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.ipec.2023.33

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

Autori: Karczmarz, Adam; Pawlewicz, Jakub; Sankowski, Piotr
Pubblicato in: SoCG, Numero 1, 2021
Editore: LIPIcs

Subquadratic dynamic path reporting in directed graphs against an adaptive adversary

Autori: Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
Pubblicato in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2023, Pagina/e 1643-1656
Editore: ACM
DOI: 10.1145/3519935.3520058

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

Autori: Charalampopoulos, Panagiotis ; Karczmarz, Adam
Pubblicato in: 28th Annual European Symposium on Algorithms (ESA 2020), 2020
Editore: 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

Autori: Harold N. Gabow, Piotr Sankowski
Pubblicato in: SIAM Journal on Computing, Numero 50/2, 2021, Pagina/e 440-486, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1106195

Frameworks for designing in-place graph algorithms

Autori: Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
Pubblicato in: Journal of Computer and System Sciences, Numero 123, 2021, Pagina/e 1-19, ISSN 0022-0000
Editore: Academic Press
DOI: 10.1016/j.jcss.2021.07.004

An Improved Algorithm for Online Min-Sum Set Cover

Autori: Marcin Bienkowski, Marcin Mucha
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 37, 2023, Pagina/e 6815-6822, ISSN 2374-3468
Editore: AAAI
DOI: 10.1609/aaai.v37i6.25835

Drawing graphs on few lines and few planes

Autori: Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
Pubblicato in: Journal of Computational Geometry, 2021, ISSN 1920-180X
Editore: Carleton University
DOI: 10.20382/jocg.v11i1a17

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

Autori: Karczmarz, Adam; Mukherjee, Anish; Sankowski, Piotr; Wygocki, Piotr
Pubblicato in: Proceedings of the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, Numero 1, 2022, ISSN 2640-3498
Editore: JMLR
DOI: 10.48550/arxiv.2108.04126

Dynamic Meta-theorems for Distance and Matching

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

Minimum rectilinear polygons for given angle sequences

Autori: William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Pubblicato in: Computational Geometry, Numero 100, 2023, Pagina/e 101820, ISSN 0925-7721
Editore: Elsevier BV
DOI: 10.1016/j.comgeo.2021.101820

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

Autori: Harold N. Gabow, Piotr Sankowski
Pubblicato in: SIAM Journal on Computing, Numero 50/2, 2021, Pagina/e 555-601, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1106225