Kostas Tsichlas

Orcid: 0000-0003-4107-9520

According to our database1, Kostas Tsichlas authored at least 84 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Explaining causality of node (non-)participation in network communities.
Inf. Sci., April, 2023

Threshold-based network structural dynamics.
Theor. Comput. Sci., 2023

Local Community Detection in Graph Streams with Anchors.
Inf., 2023

Message Recovery Attack in NTRU through VFK Lattices.
CoRR, 2023

Adopting Different Strategies for Improving Local Community Detection: A Comparative Study.
Proceedings of the Complex Networks & Their Applications XII, 2023

2022
Local community detection with hints.
Appl. Intell., 2022

A Dynamic Distributed Deterministic Load-Balancer for Decentralized Hierarchical Infrastructures.
Algorithms, 2022

Local Community Detection: A Survey.
IEEE Access, 2022

Efficient Large-Scale Machine Learning Techniques for Rapid Motif Discovery in Energy Data Streams.
Proceedings of the Artificial Intelligence Applications and Innovations, 2022

Machine Learning Techniques for Regression in Energy Disaggregation.
Proceedings of the Artificial Intelligence Applications and Innovations, 2022

State-of-the-Art in Community Detection in Temporal Networks.
Proceedings of the Artificial Intelligence Applications and Innovations. AIAI 2022 IFIP WG 12.5 International Workshops, 2022

Dynamic Local Community Detection with Anchors.
Proceedings of the Complex Networks and Their Applications XI, 2022

MAGMA: Proposing a Massive Historical Graph Management System.
Proceedings of the Algorithmic Aspects of Cloud Computing - 7th International Symposium, 2022

2021
Cost models for geo-distributed massively parallel streaming analytics.
CoRR, 2021

Dynamic layers of maxima with applications to dominating queries.
Comput. Geom., 2021

I/O-efficient 2-d orthogonal range skyline and attrition priority queues.
Comput. Geom., 2021

Evaluation of Features Generated by a High-End Low-Cost Electrical Smart Meter.
Algorithms, 2021

Investigation of Database Models for Evolving Graphs.
Proceedings of the 28th International Symposium on Temporal Representation and Reasoning, 2021

2020
Fully persistent B-trees.
Theor. Comput. Sci., 2020

Continuous outlier mining of streaming data in flink.
Inf. Syst., 2020

Dynamic planar range skyline queries in log logarithmic expected time.
Inf. Process. Lett., 2020

A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles.
Int. J. Found. Comput. Sci., 2020

Dynamic Interpolation Search revisited.
Inf. Comput., 2020

Batched Predecessor and Sorting with Size-Priced Information in External Memory.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Longest Common Subsequence on Weighted Sequences.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Towards Causal Explanations of Community Detection in Networks.
Proceedings of the Complex Networks & Their Applications IX, 2020

2019
Correction to: Virus propagation: threshold conditions for multiple profile networks.
Knowl. Inf. Syst., 2019

Virus propagation: threshold conditions for multiple profile networks.
Knowl. Inf. Syst., 2019

On the Convergence of Network Systems.
CoRR, 2019

Hinode: implementing a vertex-centric modelling approach to maintaining historical graph data.
Computing, 2019

2018
A symbolic dynamics approach to Epileptic Chronnectomics: Employing strings to predict crisis onset.
Theor. Comput. Sci., 2018

Parallel Continuous Outlier Mining in Streaming Data.
Proceedings of the 5th IEEE International Conference on Data Science and Advanced Analytics, 2018

2017
HiNode: an asymptotically space-optimal storage model for historical queries on graphs.
Distributed Parallel Databases, 2017

Skyline Queries in O(1) time?
CoRR, 2017

2016
Efficient and flexible algorithms for monitoring distance-based outliers over data streams.
Inf. Syst., 2016

Mining Uncertain Graphs: An Overview.
Proceedings of the Algorithmic Aspects of Cloud Computing - Second International Workshop, 2016

2015
Practical algorithms for execution engine selection in data flows.
Future Gener. Comput. Syst., 2015

D3-Tree: A Dynamic Distributed Deterministic Load - Balancer for decentralized tree structures.
CoRR, 2015

D<sup>2</sup>-Tree: A New Overlay with Deterministic Bounds.
Algorithmica, 2015

Virus Propagation in Multiple Profile Networks.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

D3-Tree: A Dynamic Deterministic Decentralized Structure.
Proceedings of the Algorithms - ESA 2015, 2015

ART ^+ + : A Fault-Tolerant Decentralized Tree Structure with Ultimate Sub-logarithmic Efficiency.
Proceedings of the Algorithmic Aspects of Cloud Computing - First International Workshop, 2015

An Overview of Methods for Handling Evolving Graph Sequences.
Proceedings of the Algorithmic Aspects of Cloud Computing - First International Workshop, 2015

2014
Dynamic 3-sided planar range queries with expected doubly-logarithmic time.
Theor. Comput. Sci., 2014

Going over the three dimensional protein structure similarity problem.
Artif. Intell. Rev., 2014

Dynamic Processing of Dominating Queries with Performance Guarantees.
Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

Access Methods.
Proceedings of the Computing Handbook, 2014

2013
ART: sub-logarithmic decentralized range query processing with probabilistic guarantees.
Distributed Parallel Databases, 2013

Dynamic Top-$k$ Dominating Queries
CoRR, 2013

Improved Bounds for Finger Search on a RAM.
Algorithmica, 2013

Multi-objective optimization of data flows in a multi-cloud environment.
Proceedings of the Second Workshop on Data Analytics in the Cloud, 2013

Continuous outlier detection in data streams: an extensible framework and state-of-the-art algorithms.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

I/O-efficient planar range skyline and attrition priority queues.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Querying functional brain connectomics to discover consistent subgraph patterns.
Proceedings of the 13th IEEE International Conference on BioInformatics and BioEngineering, 2013

2012
I/O-Efficient Dynamic Planar Range Skyline Queries
CoRR, 2012

DISCO: A New Algorithm for Detecting 3D Protein Structure Similarity.
Proceedings of the Artificial Intelligence Applications and Innovations, 2012

2011
A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles
CoRR, 2011

Continuous monitoring of distance-based outliers over data streams.
Proceedings of the 27th International Conference on Data Engineering, 2011

NEFOS: Rapid Cache-Aware Range Query Processing with Probabilistic Guarantees.
Proceedings of the Database and Expert Systems Applications, 2011

2010
ISB-tree: A new indexing scheme with efficient expected behaviour.
J. Discrete Algorithms, 2010

An Experimental Performance Comparison for Indexing Mobile Objects on the Plane.
Int. J. Organ. Collect. Intell., 2010

Brief announcement: ART--sub-logarithmic decentralized range query processing with probabilistic guarantees.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Efficient processing of 3-sided range queries with probabilistic guarantees.
Proceedings of the Database Theory, 2010

2009
Canonical Polygon Queries on the Plane: A New Approach.
J. Comput., 2009

Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

A novel distributed P2P simulator architecture: D-P2P-sim.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

2008
Scheduling algorithms for procrastinators.
J. Sched., 2008

A new approach on indexing mobile objects on the plane.
Data Knowl. Eng., 2008

A New Approach on the Canonical k-vertex Polygon Retrieval Problem on the Plane
CoRR, 2008

2007
Efficient Access Methods for Temporal Interval Queries of Video Metadata.
J. Univers. Comput. Sci., 2007

Algorithms for extracting motifs from biological weighted sequences.
J. Discrete Algorithms, 2007

Locating Maximal Multirepeats in Multiple Strings Under Various Constraints.
Comput. J., 2007

Indexing Mobile Objects on the Plane Revisited.
Proceedings of the Advances in Databases and Information Systems, 2007

2006
Computation of Repetitions and Regularities of Biologically Weighted Sequences.
J. Comput. Biol., 2006

Purely Functional Worst Case Constant Time Catenable Sorted Lists.
Proceedings of the Algorithms, 2006

2004
Αποδοτικές δομές εύρεσης και εφαρμογές τους
PhD thesis, 2004

Geometric Retrieval for Grid Points in the RAM Model.
J. Univers. Comput. Sci., 2004

Motif Extraction from Weighted Sequences.
Proceedings of the String Processing and Information Retrieval, 2004

2003
Optimal finger search trees in the pointer machine.
J. Comput. Syst. Sci., 2003

Rectangle Enclosure Reporting in Linear Space Revisited.
J. Autom. Lang. Comb., 2003

New Dynamic Balanced Search Trees with Worst-Case Constant Update Time.
J. Autom. Lang. Comb., 2003

Reflected min-max heaps.
Inf. Process. Lett., 2003

2002
Optimal Solutions for the Temporal Precedence Problem.
Algorithmica, 2002

Identifying Occurrences of Maximal Pairs in Multiple Strings.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002


  Loading...