Mihai Talmaciu

According to our database, Mihai Talmaciu authored at least 10 papers between 2001 and 2020.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

2020

Recognition and Optimization Algorithms for P5-Free Graphs.

Mihai Talmaciu, Luminita Dumitriu, Ioan Susnea, Victor Lepin, László Barna Iantovics

Symmetry, 2020

2019

Unobtrusive Monitoring the Daily Activity Routine of Elderly People Living Alone, with Low-Cost Binary Sensors.

Ioan Susnea, Luminita Dumitriu, Mihai Talmaciu, Emilia Pecheanu, Dan Munteanu

Sensors, 2019

2014

A Recognition Algorithm and Some Optimization Problems on Weakly Quasi-Threshold Graphs.

Mihai Talmaciu

Proceedings of the Advanced Intelligent Computational Technologies and Decision Support Systems, 2014

2013

On Confidentially Connected-Free Graphs.

Mihai Talmaciu, Elena Nechita, Barna Iantovics

Proceedings of the Advances in Intelligent Analysis of Medical Data and Decision Support Systems, 2013

Recognition and Combinatorial Optimization Algorithms for Bipartite Chain Graphs.

Mihai Talmaciu, Elena Nechita, Barna Iantovics

Comput. Informatics, 2013

2010

On Polar, Trivially Perfect Graphs.

Mihai Talmaciu, Elena Nechita

Int. J. Comput. Commun. Control, 2010

2007

Recognition Algorithm for Diamond-Free Graphs.

Mihai Talmaciu, Elena Nechita

Informatica, 2007

2005

On a k-clique-join of a class of partitionable graphs.

Mihai Talmaciu

Comput. Sci. J. Moldova, 2005

2004

Hardly perfect graphs.

Cornelius Croitoru, Cristian Frasinaru, Elefterie Olaru, Mihai Talmaciu

Sci. Ann. Cuza Univ., 2004

2001

Visibility Properties and Forbiden Holes in Graphs.

Cornelius Croitoru, Elefterie Olaru, Mihai Talmaciu

Sci. Ann. Cuza Univ., 2001