Faculty & staff

• BSc. and MSc. at Faculty of Mathematics, University Jassy, Romania
  
• Ph.D. at Faculty of Mathematics, University Bucharest, Romania

Thesis : Operations with perfect graphs

• Graph theory
• Combinatorial optimization

1976-1978: a programmer at a district center of computers
1979-1989: lecturer, Department of Mathematics, University of Galatzi, Romania
1990-1993: assistant professor, Department of Mathematics, University of Galatzi, Romania
1996-1999: research fellow, Holon Academic Institute of Technology
2000-present: senior lecturer, Holon Academic Institute of Technology

• Current Teaching: graph theory, mathematical tools in computer science
  
• Teaching History: discrete mathematics for computer science, advanced discrete mathematics, chapters in mathematics, linear algebra

• linear algebra and analytical geometry
  
• selected topics in mathematics
  
• complex functions and integral transforms
  
• discrete mathematics
  
• mathematical tools in computer sciences
  
• algorithms on graphs

1. E. Mandrescu, Strongly perfect products of graphs
   Czechoslovak Math. J. 41(116), 1991 (368-372)
   
2. E. Olaru, E. Mandrescu, S-strongly perfect Cartesian products of graphs
   J. of Graph Theory 16, 1992 (297-305)
   
3. V.E. Levit, E. Mandrescu, On -stable graphs
   Congressus Numerantium 124, 1997 (33-46)
   
4. E. Olaru, E. Mandrescu, G. Alexe, Strongly perfect tensor product of graphs
   Revue Roumaine de Math. Pures et Appliquées 43, 1998 (627-639)
   
5. V. E. Levit, E. Mandrescu, On hereditary properties of composition graphs
   Discussiones Mathematicae – Graph Theory 18, 1998 (183-195)
   
6. V. E. Levit, E. Mandrescu, Well-covered and König-Egervary graphs
   Congressus Numerantium 130, 1998 (209-218)
   
7. V. E. Levit, E. Mandrescu, Well-covered trees
   Congressus Numerantium 139, 1999 (101-112)
   
8. V. E. Levit, E. Mandrescu, On ++-stable graphs
   Congressus Numerantium 142, 2000 (207-219)
   
9. V. E. Levit, E. Mandrescu, On the structure of -stable graphs
   Discrete Mathematics 236, 2001 (227-243)
   
10. V. E. Levit, E. Mandrescu, Combinatorial properties of the family of maximum stable sets of a graph,
    Discrete Applied Mathematics 117, 2002 (149-161)
    
11. V. E. Levit, E. Mandrescu, A new Greedoid: the family of local maximum stable sets of a forest,
    Discrete Applied Mathematics 124, 2002 (91-101)
    
12. V.E. Levit, E. Mandrescu, On well-covered trees with unimodal independence
    Polynomials, Congressus Numerantium 159, 2002 (193-202)
    
13. V. E. Levit, E. Mandrescu, A family of well-covered graphs with unimodal independence polynomials,
    Congressus Numerantium 165, 2003 (195-207)
    
14. V. E. Levit, E. Mandrescu, On +-stable König-
    Egerváry graphs Discrete Mathematics 263, 2003 (179-190)
    
15. V. E. Levit, E. Mandrescu, Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings,
    Discrete Applied Mathematics 132, 2004 (163-174)
    
16. V. E. Levit, E. Mandrescu, Graph products with log-concave independence polynomials
    WSEAS Trans. on Mathematics, 3(3), 2004 (487-493)
    
17. V. E. Levit, E. Mandrescu, Very well-covered graphs with log-concave independence
    Polynomials, Carpathian J. of Mathematics 20(1), 2004 (73-80)
    
18. V. E. Levit, E. Mandrescu, Some operations preserving log-concavity of nonnegative
    functions, Mathematical Inequalities and Applications, 9(1) 2006 (63-73)
    
19. V. E. Levit, E. Mandrescu, Independence polynomials of well-covered graphs:
    Generic counterexamples for the unimodality conjecture,
    European J. of Combinatorics, 27, 2006 (931-939)
    
20. V. E. Levit, E. Mandrescu, On -critical edges in König-Egerváry graphs
    Discrete Mathematics, 306, 2006 (1684-1693)
    
21. V.E. Levit, E. Mandrescu, Independence polynomials and the unimodality conjecture for very well-covered, quasi-regularizable, and perfect graphs,
    Graph Theory – Trends in Mathematics, 2006 (243-254) Birkhauser Verlag Basel/Switzerland
    
22. V. E. Levit, E. Mandrescu, Partial unimodality of the independence polynomial for
    König-Egerváry graphs, Congressus Numerantium 179, 2006 (109-119)
    
23. V. E. Levit, E. Mandrescu, A family of graphs whose independence polynomials are both palindromic and unimodal,
    Carpathian J. of Mathematics, 23(1-2), 2007 (108-116)
    
24. V.E. Levit, E. Mandrescu, Matrices and -stable bipartite graphs,
    J. of Universal Computer Science 13(11), 2007 (1692-1706)
    
25. V. E. Levit, E. Mandrescu, Triangle-free graphs with uniquely restricted maximum
    matchings and their corresponding greedoids, Discrete App Math, 155, 2007 (2414-2425)
    
26. V. E. Levit, E. Mandrescu, On the roots of independence polynomials of almost all very well-covered graphs,
    Special issue honoring Peter Hammer
    Discrete Applied Mathematics 156, 2008 (478-491)
    
27. V.E. Levit, E. Mandrescu, The intersection of all maximum stable sets of a tree and its pendant vertices,
    Discrete Mathematics, 308, 2008 (5809–5814)
    
28. V. E. Levit, E. Mandrescu, Some structural properties of very well-covered graphs
    Congressus Numerantium, 186, 2007 (97-106)
    
29. V. E. Levit, E. Mandrescu, Graph operations and partial unimodality of independence polynomials,
    Congressus Numerantium, 190, 2008 (21-31)
    
30. V.E. Levit, E. Mandrescu, Greedoids on vertex sets of unicycle graphs
    Congressus Numerantium, 197, 2009 (183-191)
    
31. E. Mandrescu, Building graphs whose independence polynomials have only real roots
    Graphs and Combinatorics, 25, 2009 (545-556)
    
32. V.E. Levit, E. Mandrescu, Graph operations that are good for greedoids
    Discrete Applied Mathematics, 158, 2010 (1418-1423)
    
33. V.E. Levit, E. Mandrescu, A simple proof of an inequality connecting the alternating number of independent sets and the decycling number
    Discrete Mathematics, 311, 2011 (1204-1206)
    
34. V.E. Levit, E. Mandrescu, Graphs with F-symmetric independence polynomials
    Acta Universitatis Apulensis 2011 (185-194)
    
35. E. Mandrescu, I. Mirică
    Forests whose independence polynomials are palindromic and have only real roots
    J. of Advanced Mathematical Studies, 4(2), 2011 (41-50)
    
36. E. Mandrescu, I. Mirică, Independence polynomials of some graphs with extremal Fibonacci index, "Vasile Alecsandri" University of Bacău,
    Scientific Studies and Research Series Mathematics and Informatics, 21(1), 2011 (127-138)
    
37. V.E. Levit, E. Mandrescu, On symmetry of independence polynomials
    Symmetry, 3, 2011 (472-486)
    
38. V.E. Levit, E. Mandrescu, Very well-covered graphs of girth at least four and local maximum stable set greedoids
    Discrete Mathematics, Algorithms and Applications, 3(2), 2011 (245-252)
    
39. V.E. Levit, E. Mandrescu, A characterization of König-Egerváry graphs using a common property of all maximum matchings
    Electronic Notes in Discrete Mathematics, 38, 2011 (565-570)
    
40. V.E. Levit, E. Mandrescu, Critical independent sets and König-Egerváry graphs
    Graphs and Combinatorics, 28, 2012 (243-250)
    
41. V.E. Levit, E. Mandrescu, The cyclomatic number of a graph and its independence polynomial at -1,
    Graphs and Combinatorics, 29, 2013 (259-273)
    
42. V.E. Levit, E. Mandrescu, On local maximum stable set greedoids
    Discrete Mathematics, 31, 2012 (588-596)
    
43. V.E. Levit, E. Mandrescu, Vertices belonging to all critical sets of a graph
    Siam J. on Discrete Math (SIDMA), 26(1), 2012 (399-403)
    
44. V.E. Levit, E. Mandrescu, On the core of a unicyclic graph
    ARS Mathematica Contemporanea, 5, 2012 (321-327)
    
45. V.E. Levit, E. Mandrescu, Local maximum stable sets greedoids stemming from very well-covered graphs,
    Discrete Applied Mathematics, 160, 2012 (1864-1871)
    
46. E. Mandrescu, Unimodality of some independence polynomials via their palindromicity
    Australasian J. of Combinatorics, 53, 2012 (77-82)
    
47. V.E. Levit, E. Mandrescu, On the independence polynomial of an antiregular graph
    Carpathian J. of Mathematics, 28(2), 2012 (279-288)
    
48. V.E. Levit, E. Mandrescu, When is G2 a König-Egerváry graph?
    Graphs and Combinatorics 2012
    [published online: DOI 10.1007/s00373-012-1196-5, 8 June 2012]
    
49. V.E. Levit, E. Mandrescu
    On unicyclic graphs with uniquely restricted maximum matchings
    Graphs and Combinatorics 2012
    [published online: DOI 10.1007/s00373-012-1230-7, 12 October 2012]
    
50. V.E. Levit, E. Mandrescu, On the structure of the minimum critical independent set of a graph,
    Discrete Mathematics, 313, 2013 (605-610)
    
51. V.E. Levit, E. Mandrescu, On maximum matchings in König-Egerváry graphs
    Discrete Applied Mathematics, 161, 2013 (1635-1638)
    
52. V.E. Levit, E. Mandrescu, On the intersection of all critical sets of a unicyclic graph
    Discrete Applied Mathematics 2013 (in press) ttp://dx.doi.org/10.1016/j.dam.2013.09.006
    

1. E. Mandrescu, I. Mirica
   Independence polynomials of some graphs with extremal Fibonacci index
   "Gheorghe Vrănceanu" National Conference on Mathematics and Informatics,
   University of Bacau, Bacau, Romania, 26-28 May 2011
   
2. V. E. Levit and E. Mandrescu
   On symmetry of independence polynomials
   International Conference on Theory and Applications in Mathematics and Informatics
   (ICTAMI 2011), Alba Iulia, Romania, 21-24 July 2011
   
3. V. E. Levit and E. Mandrescu
   A characterization of König-Egerváry graphs using a common property of all maximum matchings
   European Conference on Combinatorics, Graph Theory and Applications (EuroComb '11), Budapest, Hungary, 29 August-2 September 2011

1. V. E. Levit and E. Mandrescu
   A set and collection Lemma
   Centre for Discrete Mathematics and its Applications (DIMAP) Workshop on Combinatorics and Graph Theory (CGT 2011), Warwick, England, 4-7 April 2011
   
2. V. E. Levit and E. Mandrescu
   A family of graphs with polynomially computable cores
   11th Haifa Workshop on Interdisciplinary Applications of Graph theory, Combinatorics and Algorithms, Haifa, Israel, 17-19 May 2011
   
3. V. E. Levit and E. Mandrescu
   András Hajnal's "Clique Collection Lemma" revisited
   Infinite and Finite Sets, Rényi Institute of Mathematics, Budapest, Hungary, 13-17 June 2011
   
4. V. E. Levit and E. Mandrescu
   On the core of a unicyclic graph
   The Seventh Congress of Romanian Mathematicians, University of Brasov, Romania, 29 June-5 July 2011
   
5. V. E. Levit and E. Mandrescu
   On the intersection of all critical sets of a unicyclic graph
   Combinatorics Conference in Lisboa (CCL 2011), Lisbon, Portugal, 11-15 July 2011
   
6. V. E. Levit and E. Mandrescu
   On independent sets in unicyclic graphs
   The 19th Conference on Applied and Industrial Mathematics (CAIM 2011), Iasi, Romania, 22-25 September 2011
   
7. E. Mandrescu and I. Mirica
   Independence polynomials of the unicyclic graphs whose Fibonacci indexes are extremal
   The 19th Conference on Applied and Industrial Mathematics (CAIM 2011), Iasi, Romania, 22-25 September 2011
   
8. V. E. Levit and E. Mandrescu
   Independent sets in almost König-Egerváry graphs
   SIAM Conference on Discrete Mathematics, Nova Scotia, Canada, 18-21 June 2012
   
9. V. E. Levit and E. Mandrescu
   Critical sets in almost unicyclic König-Egerváry graphs
   The 20th Conference on Applied and Industrial Mathematics (dedicated to Academician Mitrofan M. Ciobanu), Chişinău, Moldova, 22-25 August 2012
   
10. V. E. Levit and E. Mandrescu
    A greedoid on the vertex set of a very well-covered graph (poster)
    XVI Latin-Ibero-American Conference on Operations Research-XLIV Brazilian Symposium on Operations Research (CLAIO-SBPO 2012), Rio de Janeiro, Brazil, 24-28 September 2012
    
11. V. E. Levit and E. Mandrescu
    On f-symmetries of independence polynomials
    13th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, Haifa, Israel, 19-21 May 2013
    
12. V. E. Levit and E. Mandrescu
    On f-symmetries of independence polynomials
    13th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, Haifa, Israel, 19-21 May 2013
    
13. V. E. Levit and E. Mandrescu
    Critical independent sets in a graph
    3rd International Conference on Discrete Mathematics (ICDM-2013), Dharwad, India, 10-14 June 2013
    
14. V. E. Levit and E. Mandrescu
    A new family of palindromic independence polynomials
    Joint International Meeting of the American Mathematical Society, and the Romanian Mathematical Society, Alba Iulia, Romania, 27-30 June 2013
    
15. V. E. Levit and E. Mandrescu
    On f-symmetries of independence polynomials
    24th British Combinatorial Conference, London, UK, 30 June-5 July 2013
    
16. V. E. Levit and E. Mandrescu
    Greedoids and bipartite joins of graphs
    26th European Conference on Operational Research (EURO/INFORMS), Sapienza University, Rome, 1-4 July 2013.
    
17. V. E. Levit and E. Mandrescu
    Greedoids and Unique Perfect Matchings
    21st Conference on Applied and Industrial, (CAIM 2013), University of Bucharest, Romania,September 19 - 22, 2013
    
18. V. E. Levit and E. Mandrescu
    The intersection of all maximum independent sets and the intersection of all critical sets of a unicyclic graph are equal
    International Conference on Operations Research, OR 2013, Erasmus University Rotterdam, Holland, September 3 - 6, 2013
    
19. V. E. Levit and E. Mandrescu
    Greedoids on bertex sets of B-joins of graphs
    International Conference of Applied Mathematics (ICAM 2013) September 25 – 28, University of Baia Mare, Romania