Seminar

Mihai Patrascu Seminar in Theoretical Computer Science

The aim of this seminar is to present topics of interest in Theoretical Computer Science.This seminar address not only to researchers, but also to students interested to learn about topics in TCS such as: formal languages and automata, graphs theory, bioinformatics, complexity and approximation algorithms, applications of various fields of mathematics in Computer Science.
During the seminar there will be presentations about interesting existing results, but also original contributions and open problems, in an interactive manner.

Each seminar will last about one hour and the talks are announced via e-mail (theory-seminar@googlegroups.com)  and to the schedule on the site.

If you have any subject connected to the research interests of this group that you would like to present at the seminar or you want to receive news about this seminar, please register here theory-seminar@googlegroups.com or contact Alex Popa (alexandru.popa@fmi.unibuc.ro).

Everybody is welcome to attend.

Location – University of Bucharest, Faculty of Mathematics and Computer Science, Room 5

Schedule

2023

15 March 2023, 18:00, Room 214 (Google) – Tiberiu Sirbu (University of Bucharest)

  • Models and  algorithms for semi-autonomous transportation using platoons

8 March 2023, 18:00, Room 214 (Google) – Gabriel Istrate (University of Bucharest)

  • Mechanism Design With Predictions for Obnoxious Facility Location

18 January 2023, 16:00, Amf II (Stoilow), – Marius Zimand, Towson University

  • Hall-type theorems for fast dynamic matching and applications

2022 

24 November, 18:00, room 214 (Google) – Maria Constantin

  • “A 2-approximation Algorithm for Computing the Non-uniform Contiguous Translocation Distance”

17 November, 18:00, room 214 (Google) – Adrian Miclăuș

  • “Improvements on hairpin completion via incremental trees”

20 July, 17:00 (special session – 3 talks!), room 220

  • Itai Boneh – Bar-Ilan University – “Dynamic Palindrome Detection“
  • Marius Zimand – Towson University – “Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity”
  • Dvir Fried – Bar-Ilan University – “An Improved Algorithm for The k-Dyck Edit Distance Problem”

22 June, 16:00, room 220 – Stelian Chichirim – University of Bucharest

  • “Solving Shortest Common Superstring Problem (SCS) for bounded length strings in fewer than 2^n steps”

16 June, 16:00, room Google – Camelia Obreja – University of Bucharest

  • “New Results on Graph Colorings and Topological Indices” 

17 May, 16:00, room 220

Fahrettin AŞICI, Hasan TEMEL – Balıkesir University – PISA AND MATHEMATICAL LITERACY

Ahmet HAMDI – Balıkesir University – APPROXIMATION PROBLEMS IN SOME FUNCTION SPACES

2019

14 October, 10:00, room 5 – Radu-Stefan Mincu – University of Bucharest

  • “Heuristic Algorithms for NP-hard Problems“

09 October, 16:00, amf. Titeica:

Guillaume Blin – University of Bordeaux

  • “Algorithmic Challenges in Radiation Therapy“

Mathieu Raffinot – University of Bordeaux

  • “PQ-trees for ever (young)“

6 June, 17:00, room 3 – Tiberiu Adrian Popa – University of Bucharest

  • “Principles and Practices of Video Game Development for mobile platforms with lightweight performance impact and high-grade quality“

23 May, 17:00, room 3 – Camelia Obreja – University of Bucharest

  • “On Graceful k-colorings“

9 May, 17:00, room 3 – Ciprian Mihai Ceausescu – University of Bucharest

  • “Line search methods for Neural Networks optimisation.“

22 February, 12:00, room 202 – Costin Badica – University of Craiova

  • “Optimization of Block-Structured Scheduling Processes with Ordering Constraints“

14 February, 17:00, room 5– Virgil Emil Cazanescu – University of Bucharest

  • “Algebra Programelor”

7 February, 15:00, room 215– Lucian Gavrila – University of Bucharest

  • “An application of graph theory in netting” 

17 January, 17:00, room 5– Marius Zimand – Towson University

  • “An operational characterization of mutual information in algorithmic information theory” 

2018

6 December, 17:00, room 5– Radu-Stefan Mincu – University of Bucharest

  • “Integer Programming solutions for international kidney exchange programmes” 

29 November, 17:00, room 5 – Radu-Stefan Mincu & Alexandru Popa – University of Bucharest

  • “Heuristic algorithms for the Longest Filled Common Subsequence Problem” 
  • “Repetition Free LCS and other variants”

9 November, 18:00, room 1 – Prof. Gabriel Istrate – West University of Timisoara

  • The Ulam-Hammersley problem for integer sequences and partial orders abstract 

1 November – Marton Gyetvai – Mechanism Design Research Group at the Institute of Economics, Hungarian Academy of Sciences

  • Joint optimization of transition rules and premiums in a Bonus-Malus system abstract 

4 October 15:45, room 5

– Péter Biró – Corvinus University of Budapest & Hungarian Academy of Sciences

  • Optimisation in two-sided matching markets abstract

– Florin Manea – Christian-Albrechts-University in Kiel

  • Rollercoasters and Caterpillars abstract

19 April – Prof.dr.ing. Florin Pop – University Politehnica of Bucharest, Faculty of Automatic Control and Computers (ACS-UPB)
National Institute for Research and Development in Informatics (ICI), Bucharest

29 March – Camelia Obreja – PhD student, University of Bucharest

  • Extremal Graphs with respect to the Modified First Zagreb Connection Index abstract

15 March (Thursday) at 17 – Radu Mincu – PhD student, University of Bucharest

  • Heuristic algorithms for the min-max edge 2-coloring problem abstract

2 March – Andrei Tanasescu –University Politehnica of Bucharest

  • Techniques for Object Reconstruction from Point Cloud Data and Applications abstract

15 February – Florin Bilbie – PhD student, University of Bucharest

  • Introduction to Spiking Neural P System abstract

1 February – Stefan George Popescu – University of Bucharest

  • 2-Dimensional languages: An Introduction abstract

18 January 2018 – Andrei Patrascu – University of Bucharest

  • First order methods for relatively-smooth convex optimization abstract

4 January 2018 – Marius Zimand – Towson University

  • Distributed compression through the lens of Kolmogorov complexity abstract

7 December – Rodica Dinu – PhD student, University of Bucharest

  • The Tutte polynomial for lattice path matroids- abstract

23 November – Anca Dobrovat – University of Bucharest

  • Using supervised learning to improve multiscale modelling of damage – abstract

9 November – Liviu Stoica – student, University of Bucharest

  • Lattices . Shortest Vector Problem & Closest Vector Problem. The LLL Algorithm. Variations and Improvments to the LLL Algorithm. – slides

26 October – Stefan George Popescu – University of Bucharest

  • Networks of Polarized Evolutionary Processors – abstract

12 October – Ruxandra Marinescu-Ghemeci – University of Bucharest

  • Proper connection number of graphs – slides

28 September – Rozica Maria Tache– University of Bucharest

  • Topological indices of graphs

14 September  –  Guillaume Ducoffe – National Institute for Research and Development in Informatics, Romania

  • Fully polynomial FPT algorithms for some classes of bounded clique-width graphs – joint work with David Coudert, Guillaume Ducoffe, Alexandru Popa https://arxiv.org/abs/1707.05016

If you want to receive news on the seminar please join this group