Alexandru Popa

Camelia Obreja

Discuss. Math. Graph Theory, 2024

Optimizing Electric Vehicle Charging Infrastructure: A GNN-TSP Approach.

[BibT_eX]

[DOI]

Mohammad Mehdi Hosseinzadeh

Tiberiu Sîrbu

Proceedings of the International Conference on INnovations in Intelligent SysTems and Applications, 2024

Maximum Letter-Duplicated Subsequence (short paper).

[BibT_eX]

[DOI]

Riccardo Dondi

Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

Towards Understanding News Plagiarism: Theoretical and Experimental Analysis.

[BibT_eX]

[DOI]

Adrian Miclaus

Ionut Muraretu

Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023

Exact and approximation algorithms for synthesizing specific classes of optimal block-structured processes.

[BibT_eX]

[DOI]

Costin Badica

Simul. Model. Pract. Theory, September, 2023

Approximating Maximum Edge 2-Coloring by Normalizing Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2023

Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms.

[BibT_eX]

[DOI]

Riccardo Dondi

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

String Factorization via Prefix Free Families.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Algorithms on a Path Covering Problem with Applications in Transportation.

[BibT_eX]

[DOI]

Tiberiu Sîrbu

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem.

[BibT_eX]

[DOI]

Eugen Czeizler

Victor Popescu

Sci. Ann. Comput. Sci., 2022

Covering a Graph with Densest Subgraphs.

[BibT_eX]

[DOI]

Riccardo Dondi

Ahmed Yaser Fahad Alsahlani

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

LMAAS-IoT: Lightweight multi-factor authentication and authorization scheme for real-time data access in IoT cloud-based environment.

[BibT_eX]

[DOI]

J. Netw. Comput. Appl., 2021

Tractable low-delay atomic memory.

[BibT_eX]

[DOI]

Antonio Fernández Anta

Theophanis Hadjistasi

Nicolas Nicolaou

Alexander A. Schwarzmann

Distributed Comput., 2021

The b-Matching problem in distance-hereditary graphs and beyond.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

IP solutions for international kidney exchange programmes.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2021

A novel algorithm for clearing financial obligations between companies - An application within the Romanian Ministry of economy.

[BibT_eX]

[DOI]

Lucian-Ionut Gavrila

Ahmed Yaser Fahad Alsahlani

Algorithmic Finance, 2021

Analysis of lightweight and secure two-factor authentication scheme for wireless body area networks in health-care IoT.

[BibT_eX]

[DOI]

Proceedings of the 17th International Wireless Communications and Mobile Computing, 2021

Polynomial Algorithms for Synthesizing Specific Classes of Optimal Block-Structured Processes.

[BibT_eX]

[DOI]

Costin Badica

Proceedings of the Computational Collective Intelligence - 13th International Conference, 2021

Efficient Algorithms for Counting Gapped Palindromes.

[BibT_eX]

[DOI]

Andrei Popa

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

On the (di)graphs with (directed) proper connection number two.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

A decision support system for optimizing the cost of social distancing in order to stop the spread of COVID-19.

[BibT_eX]

[DOI]

Ahmed Yaser Fahad Alsahlani

CoRR, 2020

Analyzing of LAM-CIoT: Lightweight Authentication Mechanism in Cloud-based IoT Environment.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence, 2020

The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Complexity of Computing the Anti-Ramsey Numbers for Paths.

[BibT_eX]

[DOI]

Saeed Akhoondian Amiri

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs.

[BibT_eX]

[DOI]

David Coudert

ACM Trans. Algorithms, 2019

NewsCompare - A novel application for detecting news influence in a country.

[BibT_eX]

[DOI]

Cristian Pop

SoftwareX, 2019

Parameterized Complexity of Asynchronous Border Minimization.

[BibT_eX]

[DOI]

Algorithmica, 2019

An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers.

[BibT_eX]

[DOI]

Andrei Tanasescu

Proceedings of the Theory and Applications of Models of Computation, 2019

Algorithms for Closest and Farthest String Problems via Rank Distance.

[BibT_eX]

[DOI]

Liviu P. Dinu

Bogdan Dumitru

Proceedings of the Theory and Applications of Models of Computation, 2019

The Graceful Chromatic Number for Some Particular Classes of Graphs.

[BibT_eX]

[DOI]

Camelia Obreja

Proceedings of the 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2019

Some Remarks on the Translocation Distance.

[BibT_eX]

[DOI]

Maria Constantin

Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 23rd International Conference KES-2019, 2019

2018

Hardness and approximation of the asynchronous border minimization problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Complexity of computing the anti-Ramsey numbers.

[BibT_eX]

[DOI]

Saeed Akhoondian Amiri

Golnoosh Shahkarami

Hossein Vahidi

CoRR, 2018

A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization.

[BibT_eX]

[DOI]

Andrei Tanasescu

CoRR, 2018

Hardness and algorithmic results for the approximate cover problem.

[BibT_eX]

[DOI]

Andrei Tanasescu

CoRR, 2018

A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Local search algorithms for wireless mesh networks.

[BibT_eX]

[DOI]

CoRR, 2018

Heuristic Algorithms for the Longest Filled Common Subsequence Problem.

[BibT_eX]

[DOI]

Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

Extremal Graphs with Respect to the Modified First Zagreb Connection Index.

[BibT_eX]

[DOI]

Camelia Obreja

Rozica Maria Tache

Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

Better Heuristic Algorithms for the Repetition Free LCS and Other Variants.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2016

Min-Sum 2-Paths Problems.

[BibT_eX]

[DOI]

Trevor I. Fenner

Oded Lachish

Theory Comput. Syst., 2016

Approximation and hardness results for the maximum edge q-coloring problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

A Parameterized Study of Maximum Generalized Pattern Matching Problems.

[BibT_eX]

[DOI]

Sebastian Ordyniak

Algorithmica, 2016

SOBRA - Shielding Optimization for BRAchytherapy.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Enumeration of Steiner triple systems with subsystems.

[BibT_eX]

[DOI]

Petteri Kaski

Patric R. J. Östergård

Math. Comput., 2015

The Min-Max Edge q-Coloring Problem.

[BibT_eX]

[DOI]

Tommi Larjomaa

J. Graph Algorithms Appl., 2015

Algorithmic and Hardness Results for the Colorful Components Problems.

[BibT_eX]

[DOI]

Algorithmica, 2015

Making "Fast" Atomic Operations Computationally Tractable.

[BibT_eX]

[DOI]

Antonio Fernández Anta

Nicolas C. Nicolaou

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

A Unifying Framework for Interactive Programming and Applications to Communicating Peer-to-Peer Systems.

[BibT_eX]

[DOI]

Iulia Teodora Banu-Demergian

Camelia Chira

Florian Mircea Boian

Gheorghe Stefanescu

Proceedings of the Embracing Global Computing in Emerging Economies - First Workshop, 2015

2014

Better lower and upper bounds for the minimum rainbow subgraph problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem.

[BibT_eX]

[DOI]

Guillaume Blin

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly.

[BibT_eX]

[DOI]

Eugen Czeizler

Theor. Comput. Sci., 2013

Enumerating Cube Tilings.

[BibT_eX]

[DOI]

K. Ashik Mathew

Patric R. J. Östergård

Ashik Mathew Kizhakkepallathu

Discret. Comput. Geom., 2013

On the Shannon Capacity of Triangular Graphs.

[BibT_eX]

[DOI]

Patric R. J. Östergård

Electron. J. Comb., 2013

Modelling the Power Supply Network - Hardness and Approximation.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

2012

Hardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract).

[BibT_eX]

[DOI]

Prudence W. H. Wong

Fencol C. C. Yung

Proceedings of the Theory and Applications of Models of Computation, 2012

On the Closest String via Rank Distance.

[BibT_eX]

[DOI]

Liviu Petrisor Dinu

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Approximating the Rainbow - Better Lower and Upper Bounds.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

Approximation lower and upper bounds for a selection of combinatorial optimization problems.

[BibT_eX]

[DOI]

PhD thesis, 2011

Maximum subset intersection.

[BibT_eX]

[DOI]

Raphaël Clifford

Inf. Process. Lett., 2011

Restricted Common Superstring and Restricted Common Supersequence.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

Hardness and Approximation of The Asynchronous Border Minimization Problem

[BibT_eX]

[DOI]

Prudence W. H. Wong

Fencol C. C. Yung

CoRR, 2010

Permuted Common Supersequence

[BibT_eX]

[DOI]

CoRR, 2010

(In)approximability Results for Pattern Matching Problems.

[BibT_eX]

[DOI]

Raphaël Clifford

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

On Shortest Common Superstring and Swap Permutations.

[BibT_eX]

[DOI]

Zvi Gotthilf

Moshe Lewenstein

Proceedings of the String Processing and Information Retrieval, 2010

Approximation and Hardness Results for the Maximum Edge <i>q</i>-coloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Generalised Matching.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2009

2008

Undecidability Results for Finite Interactive Systems.

[BibT_eX]

[DOI]

Alexandru Sofronia

Gheorghe Stefanescu

Proceedings of the SYNASC 2008, 2008

2007

High-level Structured Interactive Programs with Registers and Voices.

[BibT_eX]

[DOI]