default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvangelos Kosinas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis:
2-Fault-Tolerant Strong Connectivity Oracles. ALENEX 2024: 91-104- [c10]Bingbing Hu, Evangelos Kosinas, Adam Polak
:
Connectivity Oracles for Predictable Vertex Failures. ESA 2024: 72:1-72:16 - [c9]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time. FOCS 2024: 62-85 - [c8]Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas, Partha Sarathi Mandal:
Online Drone Scheduling for Last-Mile Delivery. SIROCCO 2024: 488-493 - [c7]Evangelos Kosinas:
Computing the 5-Edge-Connected Components in Linear Time. SODA 2024: 1887-2119 - [i10]Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas, Partha Sarathi Mandal:
Online Drone Scheduling for Last-mile Delivery. CoRR abs/2402.16085 (2024) - 2023
- [c6]Evangelos Kosinas:
Connectivity Queries Under Vertex Failures: Not Optimal, but Practical. ESA 2023: 75:1-75:13 - [c5]Loukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas:
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems. IWOCA 2023: 209-220 - [i9]Loukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas:
On 2-strong connectivity orientations of mixed graphs and related problems. CoRR abs/2302.02215 (2023) - [i8]Evangelos Kosinas:
Connectivity Queries under Vertex Failures: Not Optimal, but Practical. CoRR abs/2305.01756 (2023) - [i7]Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis:
2-Fault-Tolerant Strong Connectivity Oracles. CoRR abs/2311.00854 (2023) - [i6]Evangelos Kosinas:
Computing the 5-Edge-Connected Components in Linear Time. CoRR abs/2311.04865 (2023) - [i5]Bingbing Hu, Evangelos Kosinas, Adam Polak:
Connectivity Oracles for Predictable Vertex Failures. CoRR abs/2312.08489 (2023) - 2022
- [c4]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. ESA 2022: 60:1-60:16 - [i4]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas, Debasish Pattanayak:
On maximal 3-edge-connected subgraphs of undirected graphs. CoRR abs/2211.06521 (2022) - 2021
- [c3]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph in Linear Time. ESA 2021: 47:1-47:17 - [c2]Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. SEA 2021: 20:1-20:19 - [i3]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph in Linear Time. CoRR abs/2105.02910 (2021) - [i2]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph. CoRR abs/2108.08558 (2021) - 2020
- [c1]Loukas Georgiadis, Evangelos Kosinas:
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. ISAAC 2020: 38:1-38:16 - [i1]Loukas Georgiadis, Evangelos Kosinas:
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. CoRR abs/2007.03933 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
