Seguir
Mihai Talmaciu
Mihai Talmaciu
Dirección de correo verificada de ub.ro - Página principal
Título
Citado por
Citado por
Año
Unobtrusive monitoring the daily activity routine of elderly people living alone, with low-cost binary sensors
I Susnea, L Dumitriu, M Talmaciu, E Pecheanu, D Munteanu
Sensors 19 (10), 2264, 2019
462019
Decomposition problems in the graph theory with applications in combinatorial optimization
M Talmaciu
Ph. D. Thesis, 2002
392002
Recognition Algorithm for diamond-free graphs
M Talmaciu, E Nechita
Informatica 18 (3), 457-462, 2007
372007
On Confidentially connected graphs
C CROITORU, M TALMACIU
Buletinul științific al Universitatii Baia Mare, Seria B, Fascicola …, 2000
242000
A Bayesian approach for the assessment of risk probability. Case study for digital risk probability
E Nechita, CV Muraru, M Talmaciu
Environmental Engineering and Management Journal 11 (12), 2249-2256, 2012
92012
Some combinatorial optimization problems for weak-bisplit graphs
M Talmaciu, E Nechita
Studies in Informatics and Control 19 (4), 427-434, 2010
92010
A new graph search algorithm and some applications, presented at ROSYCS 2000, Univ.”
C Croitoru, M Talmaciu
Al. I. Cuza” Iasi, 2000
92000
A Recognition Algorithm for a Class of Partitionable Graphs that Satisfies the Normal Graph Conjecture
M Talmaciu, E Nechita, GC Crisan
Studies in Informatics and Control 18 (4), 349, 2009
82009
Confidentially connected graphs, The annals of the University" Dunarea de Jos" of Galati, Suppliment to Tome XVIII (XXII) 2000
C Croitoru, E Olaru, M Talmaciu
Proceedings of the international conference" The risk in contemporany economy, 2000
72000
Recognition and combinatorial optimization algorithms for bipartite chain graphs
M Talmaciu, E Nechita, B Iantovics
Computing and Informatics 32 (2), 313-329, 2013
62013
Mechanisms in social insect societies and their use in Optimization. A case study for trail laying behavior
E Nechita, CV Muraru, M Talmaciu
AIP Conference Proceedings 1117 (1), 171-179, 2009
52009
A Class of Partitionable Graphs
E Olaru, MA TALmAciu
Bulletin mathématique de la Société des Sciences Mathématiques de Roumanie …, 2005
42005
Fast algorithms of dually chordal graphs
M TALMACIU
Scientific Studies and Research 25 (1), 2015
32015
How often does the Parrondo effect appear?
GC Crisan, E Nechita, M Talmaciu
Fluctuation and Noise Letters 7 (02), C19-C25, 2007
32007
Algorithms for the Recognition of Net-free Graphs and for Computing Maximum Cardinality Matchings in Claw-free Graphs
M Talmaciu, V Lepin
Studies in Informatics and Control 23 (2), 184, 2014
22014
On polar, trivially perfect graphs
M Talmaciu, E Nechita
International Journal of Computers Communications & Control 5 (5), 939-945, 2010
22010
The normal graph conjecture is true for minimal unbreakable graphs
M TALMACIU
Scientific Studies and Research 19 (2), 2009
22009
Cooperative ant colonies for vehicle routing problem with time windows. a case study in the distribution of dietary products
E Nechita, GC Crisan, M Talmaciu
Proceedings of the 12th World Multiconference on Systemics, Cybernetics and …, 2008
22008
A recognition algorithm for trivially perfect graphs
M Talmaciu, E Nechita
Stud. Cercet. Ştiinţ., Ser. Mat 17, 239-244, 2007
22007
Fast algorithms of hereditary doubly chordal graphs
M Talmaciu
Scientific Studies and Research 26 (1), 2016
12016
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20