Nikos Parotsidis

Available identifiers

zbMath Open parotsidis.nikosMaRDI QIDQ1640997

List of research outcomes

Publication	Date of Publication	Type
A metaheuristic algorithm for large maximum weight independent set problems	2025-01-15	Paper
Optimal decremental connectivity in non-sparse graphs	2024-11-14	Paper
Faster computation of 3-edge-connected components in digraphs	2024-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q6147265	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6147421	2024-01-15	Paper
Collaborative procrastination	2023-02-07	Paper
Faster algorithms for all-pairs bounded min-cuts	2022-07-21	Paper
Dominating sets and connected dominating sets in dynamic graphs	2022-07-18	Paper
New instances for maximum weight independent set from a vehicle routing application	2021-11-08	Paper
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph	2021-01-27	Paper
Strong connectivity in directed graphs under failures, with applications	2020-09-17	Paper
Decremental data structures for connectivity and dominators in directed graphs	2020-05-27	Paper
All-pairs 2-reachability in \(\mathcal{O}(n^\omega\log n)\) time	2020-05-27	Paper
Incremental strong connectivity and 2-connectivity in directed graphs	2020-02-12	Paper
2-connectivity in directed graphs: an experimental study	2019-09-12	Paper
Computing 2-connected components and maximal 2-connected subgraphs in directed graphs: an experimental study	2019-09-12	Paper
2-Edge Connectivity in Directed Graphs	2018-11-05	Paper
Strong connectivity in directed graphs under failures, with applications	2018-07-16	Paper
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs	2018-07-16	Paper
2-vertex connectivity in directed graphs	2018-06-14	Paper
2-Connectivity in Directed Graphs (Invited Talk)	2018-03-02	Paper
Incremental 2-edge-connectivity in directed graphs	2017-12-19	Paper
Sparse certificates for 2-connectivity in directed graphs	2017-11-06	Paper
2-edge connectivity in directed graphs	2017-10-05	Paper
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs	2015-11-19	Paper
2-vertex connectivity in directed graphs	2015-10-27	Paper

Research outcomes over time

This page was built for person: Nikos Parotsidis