3 citations · 4 across the 5 of their papers we have counts for
7 papers
Streaming Diameter of High-Dimensional Points
Magnús M. Halldórsson, Nicolaos Matsakis, Pavel Veselý
We improve the space bound for streaming approximation of Diameter but also of Farthest Neighbor queries, Minimum Enclosing Ball and its Coreset, in high-dimensional Euclidean spac…
Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
In the Shortest Superstring problem, we are given a set of strings and we are asking for a common superstring, which has the minimum number of characters. The Shortest Superstring…
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis +1
We consider the problem of managing the buffer of a shared-memory switch that transmits packets of unit value. A shared-memory switch consists of an input port, a number of output…
The Longest Queue Drop Policy for Shared-Memory Switches is 1.5-competitive
Nicolaos Matsakis
We consider the Longest Queue Drop memory management policy in shared-memory switches consisting of output ports. The shared memory of size may have an arbitrary numb…
Matching sequences of two digits in matrices is hard
Nicolaos Matsakis
We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too)…
Solving the Rural Postman problem using the Adleman-Lipton model
Nicolaos Matsakis
In this survey we investigate the application of the Adleman-Lipton model on Rural Postman problem, which given an undirected graph with positive integer lengths on each…
Transforming a random graph drawing into a Lombardi drawing
Nicolaos Matsakis
The visualization of any graph plays important role in various aspects, such as graph drawing software. Complex systems (like large databases or networks) that have a graph structu…