10.9k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- The Ohio State UniversityUS619 papers
- Centre National de la Recherche ScientifiqueFR616 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR605 papers
- National Institute for Subatomic PhysicsNL600 papers
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ596 papers
- European Organization for Nuclear ResearchCH589 papers
- Czech Technical University in PragueCZ585 papers
- Lawrence Berkeley National LaboratoryUS585 papers
- University of CopenhagenDK585 papers
- University of Science and Technology of ChinaCN585 papers
- University of BonnDE584 papers
- University of OsloNO584 papers
11 papers · 1 filter
An output-sensitive algorithm for the minimization of 2-dimensional String Covers
Alexandru Popa, Andrei Tanasescu
String covers are a powerful tool for analyzing the quasi-periodicity of 1-dimensional data and find applications in automata theory, computational biology, coding and the analysis…
Line-Constrained Geometric Server Placement
Mugurel Ionut Andreica, Eliana-Dina Tirsa
In this paper we present new algorithmic solutions for several constrained geometric server placement problems. We consider the problems of computing the 1-center and obnoxious 1-c…
Clustering, Encoding and Diameter Computation Algorithms for Multidimensional Data
Mugurel Ionut Andreica, Eliana-Dina Tirsa
In this paper we present novel algorithms for several multidimensional data processing problems. We consider problems related to the computation of restricted clusters and of the d…
Practical Range Aggregation, Selection and Set Maintenance Techniques
Mugurel Ionut Andreica, Nicolae Tapus
In this paper we present several new and very practical methods and techniques for range aggregation and selection problems in multidimensional data structures and other types of s…
Optimal Geometric Partitions, Covers and K-Centers
Mugurel Ionut Andreica, Eliana-Dina Tirsa, Cristina Teodora Andreica +2
In this paper we present some new, practical, geometric optimization techniques for computing polygon partitions, 1D and 2D point, interval, square and rectangle covers, as well as…
Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems
Mugurel Ionut Andreica, Nicolae Tapus
In this paper we consider several problems concerning packet routing in distributed systems. Each problem is formulated using terms from Graph Theory and for each problem we presen…
Efficient Algorithms for Several Constrained Resource Allocation, Management and Discovery Problems
Mugurel Ionut Andreica, Madalina Ecaterina Andreica, Daniel Ardelean
In this paper we present efficient algorithmic solutions for several constrained resource allocation, management and discovery problems. We consider new types of resource allocatio…
Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems
Mugurel Ionut Andreica, Eliana-Dina Tirsa, Alexandru Costan +1
In this paper we address several network design, clustering and Quality of Service (QoS) optimization problems and present novel, efficient, offline algorithms which compute optima…
Offline Algorithmic Techniques for Several Content Delivery Problems in Some Restricted Types of Distributed Systems
Mugurel Ionut Andreica, Nicolae Tapus
In this paper we consider several content delivery problems (broadcast and multicast, in particular) in some restricted types of distributed systems (e.g. optical Grids and wireles…
Minimum Dissatisfaction Personnel Scheduling
Mugurel Ionut Andreica, Romulus Andreica, Angela Andreica
In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a sequ…
Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths
Mugurel Ionut Andreica
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, I…