Login
 Forum
 
 
Personal data sheet
 Print preview
VALIDITY EXPIRED
personal data approved: 2022. IV. 08.
Personal data
Tamás Kis
name Tamás Kis
name of institution
doctoral school
BME Doctoral School of Mathematics and Computer Sciences (Academic staff member)
(discipline) Habilitation Comittee and Doctoral Council (external member)
ELTE Doctoral School of Mathematics (Supervisor)
the share of work in the different doctoral schools. ELTE Doctoral School of Mathematics 100%
accreditation statement submitted to: Eötvös Loránd University, Budapest
Contact details
E-mail address tamas.kissztaki.hu
phone number +36 1 279-6156
own web page
Academic title
scientific degree, title Ph.D.
year degree was obtained 2001
discipline to which degree belongs mathematics and computing
institution granting the degree Ecole Polytechnique Federale de Lausanne
scientific degree, title DSc
year degree was obtained 2018
discipline to which degree belongs mathematics and computing
institution granting the degree HAS
Employment
2010 - Eötvös Loránd University, Budapest
university professor or researcher
2002 - SZTAKI
scientific consultant
Thesis topic supervisor
number of doctoral students supervised until now 6.5
number of students who fulfilled course requirements 2.5
students who obtained their degrees:
Markó Horváth PhD 2020  DSM
Péter Györgyi PhD 2018  DSM
(50%) Márton Drótos PhD 2015  

completed course requirement:
Gábor Sunil Morapitiye (PhD) 2023/01  DSMCS-BME
present PhD students:
Evelin Szögi (PhD) (2026/08)  DSM
Péter Dobrovoczki (PhD) (2025/08)  DSM
Tímea Tamási (PhD) (2024/08)  DSM
  Thesis topic proposals
Research
research area Scheduling theory, disjunctive programming
research field in which current research is conducted mathematics and computing
Publications
2022

Györgyi Péter, Kis Tamás: New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints, DISCRETE APPLIED MATHEMATICS 311: pp. 97-109.
type of document: Journal paper/Article
number of independent citations: 4
language: English
URL 
2019

Horváth M, Kis T: Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price, CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 27: (1) pp. 39-67.
type of document: Journal paper/Article
number of independent citations: 25
language: English
URL 
2019

Györgyi Péter, Kis Tamás: Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints, JOURNAL OF SCHEDULING 22: (6) pp. 623-634.
type of document: Journal paper/Article
number of independent citations: 6
language: English
URL 
2019

Györgyi P, Kis T: A probabilistic approach to pickup and delivery problems with time window uncertainty, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 274: (3) pp. 909-923.
type of document: Journal paper/Article
number of independent citations: 24
language: English
URL 
2018

Györgyi P, Kis T: Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut, COMPUTERS AND INDUSTRIAL ENGINEERING 115: pp. 220-225.
type of document: Journal paper/Article
number of independent citations: 7
language: English
URL 
2017

Györgyi P, Kis T: Approximation schemes for parallel machine scheduling with non-renewable resources, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 258: (1) pp. 113-123.
type of document: Journal paper/Article
number of independent citations: 16
language: English
URL 
2016

Horváth M, Kis T: Solving resource constrained shortest path problems with LP-based methods, COMPUTERS & OPERATIONS RESEARCH 73: pp. 150-164.
type of document: Journal paper/Article
number of independent citations: 24
language: English
URL 
2009

Drótos M, Erdős F, Kis T: Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 197: (1) pp. 296-306.
type of document: Journal paper/Article
number of independent citations: 25
language: English
URL 
2005

Kis T: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities, MATHEMATICAL PROGRAMMING 103: (3) pp. 515-539.
type of document: Journal paper/Article
number of independent citations: 82
language: English
URL 
2004

Kis T: On the complexity of the car sequencing problem, OPERATIONS RESEARCH LETTERS 32: (4) pp. 331-335.
type of document: Journal paper/Article
number of independent citations: 91
language: English
URL 
Number of independent citations to these publications:304 
Scientometric data
list of publications and citations
number of scientific publications that meet accreditation criteria:
140
number of scientific publications:
141
monographs and professional books:
0
monographs/books in which chapters/sections were contributed:
3 
scientific publications published abroad that meet the accreditation criteria:
118
publications not in Hungarian, published in Hungary, meeting the accreditation criteria:
13
number of independent citations to scientific publications and creative works:
1262

 
All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 2.2358 ( 2017. X. 31. )