Petr Hliněný

V\U000000fduka a dal\U00000161\U000000ed informace pro studenty

Prof. RNDr. Petr Hliněný, Ph.D.

@ynenilhfi.muni.cz
Fakulta Informatiky MU Brno
Kancel\U000000e1\U00000159 C418 v budov\U0000011b FI, 4. patro
Kalend\U000000e1\U00000159, kde naleznete mou v\U000000fduku, konzultace i zkou\U00000161ky

Jste mlad\U000000ed studenti a chcete se zapojit do na\U00000161eho v\U0000011bdeck\U000000e9ho v\U000000fdzkumu?

"Masová" v\U000000fduka na FI MU Brno, podzim

M\U000000e1 podzimn\U000000ed v\U000000fduka je ve znamen\U000000ed masovosti (s \U00000159\U000000e1dov\U0000011b stovkami student\U0000016f a z toho bohu\U0000017eel pramen\U000000edc\U000000edm form\U000000e1ln\U000000edm a p\U00000159\U000000edsn\U000000fdm p\U00000159\U000000edstupem k v\U000000fduce). Pod\U000000edvejte se sami:

FI:IB000 Matematick\U000000e9 z\U000000e1klady informatiky,
* sylabus zahrnuj\U000000edc\U000000ed podm\U000000ednky studia * povinn\U0000011b sledovan\U000000e9 aktuality * a rozvrh.
- Vzletn\U0000011b \U00000159e\U0000010deno: V tomto p\U00000159edm\U0000011btu se poslucha\U0000010di seznam\U000000ed se z\U000000e1kladn\U000000edmi matematick\U000000fdmi konstrukcemi pot\U00000159ebn\U000000fdmi pro studium informatiky. Vytv\U000000e1\U00000159\U000000ed se t\U000000edm pojmov\U000000fd a form\U000000e1ln\U000000ed z\U000000e1klad pro \U00000159adu dal\U00000161\U000000edch p\U00000159edm\U0000011bt\U0000016f, kter\U000000e9 pat\U00000159\U000000ed k z\U000000e1kladn\U000000ed teoretick\U000000e9 v\U000000fdbav\U0000011b informatik\U0000016f. \U000000dasp\U0000011b\U00000161n\U000000fd absolvent kurzu bude: zn\U000000e1t z\U000000e1kladn\U000000ed matematick\U000000e9 pojmy; schopn\U000000fd porozum\U0000011bt logick\U000000e9 struktu\U00000159e matematick\U000000e9 v\U0000011bty a matematick\U000000e9ho d\U0000016fkazu; ovl\U000000e1dat diskr\U000000e9tn\U000000ed matematick\U000000e9 struktury jako kone\U0000010dn\U000000e9 mno\U0000017einy, relace, funkce a grafy, v\U0000010detn\U0000011b jejich pou\U0000017e\U000000edv\U000000e1n\U000000ed v informatice; um\U0000011bt p\U00000159esn\U0000011b formulovat vlastn\U000000ed tvrzen\U000000ed \U0000010di algoritmy a jejich d\U0000016fkazy; aplikovat z\U000000edskan\U000000e9 form\U000000e1ln\U000000ed n\U000000e1stroje v dal\U00000161\U000000edm studiu informatiky i n\U000000e1sledn\U000000e9 praxi.
- Jde o \U000000favod do matematiky vysoko\U00000161kolsk\U000000e9ho typu s velk\U000000fdm d\U0000016frazem na diskr\U000000e9tn\U000000ed matematiku a na p\U00000159esn\U000000e9 vyjad\U00000159ov\U000000e1n\U000000ed ve vztahu k informatick\U000000fdm oblastem.
V r\U000000e1mci kurzu existuje i skupina pokro\U0000010dil\U000000e9ho cvi\U0000010den\U000000ed, ur\U0000010denou pro studenty se z\U000000e1jmem se z matematiky dozv\U0000011bd\U0000011bt v\U000000edce ne\U0000017e je b\U0000011b\U0000017en\U000000e1 n\U000000e1pl\U00000148 p\U00000159edm\U0000011btu.

V\U000000fdb\U0000011brov\U000000e1 v\U000000fduka na FI MU Brno (jaro)

Mimo tu v\U000000fd\U00000161e zmi\U00000148ovanou masovou \U0000010d\U000000e1st je zbytek m\U000000e9 v\U000000fduk\U000000fd odli\U00000161n\U000000fd a soust\U00000159e\U0000010fuje se na mal\U000000e9 v\U000000fdb\U0000011brov\U000000e9 p\U00000159edm\U0000011bty m\U000000e9n\U0000011b form\U000000e1ln\U000000edho a semin\U000000e1rn\U000000edho typu. Prost\U0000011b z\U000000e1bavn\U0000011b pro zan\U000000edcen\U000000e9 studenty a bez n\U0000011bjak\U000000e9ho stresu jinak doprov\U000000e1zej\U000000edc\U000000edho masovou v\U000000fduku...

FI:MA026 Pokro\U0000010dil\U000000e1 kombinatorika
- vybran\U000000e1 pokro\U0000010dil\U000000e1 kombinatorick\U000000e1 t\U000000e9mata, naprosto nutn\U000000e1 dobr\U000000e1 znalost kombinatoriky a graf\U0000016f z p\U00000159edchoz\U000000edho studia,
- m\U0000016f\U0000017ee se konat jen co dva roky podle z\U000000e1jmu student\U0000016f.
FI:IV131 Semin\U000000e1\U00000159 laborato\U00000159e DIMEA
- tematicky v\U000000fdzkumn\U0000011b zam\U0000011b\U00000159en\U000000e9 semin\U000000e1rn\U000000ed skupiny
- p\U00000159esn\U000000e1 t\U000000e9mata podle aktu\U000000e1ln\U000000edho v\U000000fdzkumu skupiny a domluvy se studenty.
A tak\U000000e9 ka\U0000017edoro\U0000010dn\U000000ed jarn\U000000ed FI:IV119 Semin\U000000e1\U00000159 z Diskr\U000000e9tn\U000000edch Matematick\U000000fdch Metod n\U000000ed\U0000017ee.

Zapojen\U000000ed student\U0000016f do na\U00000161eho v\U000000fdzkumu
- p\U00000159\U000000edle\U0000017eitosti ji\U0000017e pro mlad\U000000e9 studenty

L\U000000e1k\U000000e1 v\U000000e1s hlub\U00000161\U000000ed v\U0000011bdeck\U000000e9 pozn\U000000e1n\U000000ed, ale boj\U000000edte se, \U0000017ee jako mlad\U000000ed studenti je\U00000161t\U0000011b nem\U000000e1te \U00000161anci? P\U00000159esto tu mo\U0000017enosti jsou - u\U0000017e pro studenty za\U0000010d\U000000ednaj\U000000edc\U000000ed bakal\U000000e1\U00000159sk\U000000e9 studium, jen se neb\U000000e1t a n\U0000011bco zkusit...

Jarn\U000000ed studentsk\U000000fd FI:IV119 Semin\U000000e1\U00000159 z Diskr\U000000e9tn\U000000edch Matematick\U000000fdch Metod
- M\U000000e1te matematiku r\U000000e1di natolik, \U0000017ee v\U000000e1m b\U0000011b\U0000017en\U000000e1 porce a hloubka jej\U000000ed v\U000000fduky na FI nesta\U0000010d\U000000ed? P\U00000159i\U0000010dichli jste n\U0000011bkdy d\U00000159\U000000edve k Matematick\U000000e9 olympi\U000000e1d\U0000011b a zaj\U000000edm\U000000e1 v\U000000e1s, jak pokra\U0000010dovat na podobnou notu na V\U00000160? A cht\U0000011bli byste v\U0000011bd\U0000011bt, jak rychle se m\U0000016f\U0000017eete dostat ke skute\U0000010dn\U000000e9 matematick\U000000e9 v\U0000011bd\U0000011b? Pak p\U00000159ij\U0000010fte do IV119...
- Ofici\U000000e1ln\U000000ed informace k semin\U000000e1\U00000159i najdete v IS v\U0000010detn\U0000011b kredit\U0000016f za n\U0000011bj (pro v\U00000161echny aktivn\U000000ed studenty). Hlavn\U000000ed n\U000000e1pln\U000000ed semin\U000000e1\U00000159e bude neform\U000000e1ln\U000000ed spole\U0000010dn\U000000e9 studium a prezentace kr\U000000e1sn\U000000e9 matematick\U000000e9 knihy "Proofs from THE BOOK" a jazykem bude podle situace angli\U0000010dtina nebo \U0000010de\U00000161tina.
V\U000000fdzkumn\U000000e1 Laborato\U00000159 DIMEA p\U0000016fsob\U000000edc\U000000ed neform\U000000e1ln\U0000011b cel\U000000fd akademick\U000000fd rok:
- Veden\U000000e1 od roku 2018 spole\U0000010dn\U0000011b s prof. Danielem Kr\U000000e1\U0000013eem (d\U00000159\U000000edve \U000000fa\U0000010dast v bl\U000000edzk\U000000e9 laborato\U00000159i Formela).
- Laborato\U00000159 diskr\U000000e9tn\U000000edch metod a algoritm\U0000016f (DIMEA) se zab\U000000fdv\U000000e1 oblastmi diskr\U000000e9tn\U000000ed matematiky, kter\U000000e9 jsou v\U000000fdznamn\U000000e9 z hlediska informatiky, a n\U000000e1vrhem diskr\U000000e9tn\U000000edch algoritm\U0000016f. Oblasti v\U000000fdzkumu \U0000010dlen\U0000016f laborato\U00000159e zahrnuj\U000000ed algoritmickou, geometrickou, struktur\U000000e1ln\U000000ed a topologickou teorii graf\U0000016f, extrem\U000000e1ln\U000000ed kombinatoriku a analytick\U000000e9 reprezentace velk\U000000fdch diskr\U000000e9tn\U000000edch objekt\U0000016f.
- P\U00000159ij\U0000010fte se pod\U000000edvat na n\U000000e1\U00000161 spojen\U000000fd teoretick\U000000fd p\U00000159edn\U000000e1\U00000161kov\U000000fd semin\U000000e1\U00000159 na FI...

T\U000000e9mata bakal\U000000e1\U00000159sk\U000000fdch a diplomov\U000000fdch prac\U000000ed

P\U00000159irozenou pozd\U0000011bj\U00000161\U000000ed mo\U0000017enost\U000000ed se p\U00000159idat k na\U00000161emu v\U000000fdzkumn\U000000e9mu t\U000000fdmu je si zvolit n\U000000e1m bl\U000000edzk\U000000e9 v\U000000fdzkumn\U000000e9 t\U000000e9ma pro BP nebo DP. Hled\U000000e1m p\U00000159edev\U00000161\U000000edm studenty, kte\U00000159\U000000ed od t\U000000e9matu o\U0000010dek\U000000e1vaj\U000000ed trochu v\U000000edc, ne\U0000017e to jen co nejrychleji m\U000000edt za sebou, kte\U00000159\U000000ed by r\U000000e1di n\U0000011bco nov\U000000e9ho a v\U0000011bdecky hodnotn\U000000e9ho vymysleli.

Pro bakal\U000000e1\U00000159sk\U000000e9 studium nab\U000000edz\U000000edm v z\U000000e1sad\U0000011b jedin\U000000e9 v\U00000161eobj\U000000edmaj\U000000edc\U000000ed t\U000000e9ma, pod kter\U000000fdm se lze v\U0000011bnovat spoust\U0000011b r\U0000016fzn\U000000fdch oblast\U000000ed graf\U0000016f a algoritm\U0000016f - podle p\U00000159\U000000e1n\U000000ed student\U0000016f.
Nab\U000000eddka pro diplomov\U000000e9 pr\U000000e1ce je ji\U0000017e ob\U0000010das specifi\U0000010dt\U0000011bj\U00000161\U000000ed a krom\U0000011b generick\U000000e9ho t\U000000e9matu zahrnuje v\U0000011bt\U00000161\U000000ed po\U0000010det konkr\U000000e9tn\U000000edch n\U000000e1m\U0000011bt\U0000016f a probl\U000000e9m\U0000016f, kter\U000000e9 lze vyhledat v seznamu podle jmen \U00000161kolitel\U0000016f (mne \U0000010di m\U000000fdch spolupracovn\U000000edk\U0000016f).
- T\U000000e9mata zahrnuj\U000000ed t\U00000159eba: studium struktur\U000000e1ln\U000000edch \U00000161\U000000ed\U00000159kov\U000000fdch parametr\U0000016f graf\U0000016f, z\U000000edsk\U000000e1n\U000000ed \U0000010di v\U000000fdpo\U0000010dty p\U00000159\U000000edslu\U00000161n\U000000fdch dekompozic, navrhov\U000000e1n\U000000ed specifick\U000000fdch parametrizovan\U000000fdch algoritm\U0000016f na grafech, studium r\U0000016fzn\U000000fdch aspekt\U0000016f pr\U0000016fse\U0000010d\U000000edkov\U000000e9ho \U0000010d\U000000edsla grafu, n\U0000011bkter\U000000e9 ot\U000000e1zky kombinatorick\U000000e9 geometrie, atd...
Vybran\U000000e1 velmi \U000000fasp\U0000011b\U00000161n\U000000e1 t\U000000e9mata prac\U000000ed minul\U000000fdch let:
- Twin-width of planar graphs, Computing twin-width parametrized by restrictive parameters, Stack number and queue number of graphs, Constructive twin-width for posets of small width, Crossing-critical graphs of high vertex degrees, FO properties of geometric graphs, Obstructions for graphs of low rank-depth, Efficient solvability of graph MSO properties, Partitioning of Weighted Graphs into k Connected Subgraphs, Construction of planar emulators of graphs, Efficient route-planning in huge graphs, Planar graph emulators: Fellows' conjecture, Automata-formalization for graphs of bounded rank-width...

Doktorsk\U000000e9 studium

Viz tak\U000000e9 ofici\U000000e1ln\U000000ed str\U000000e1nky na FI MU Brno.

Studenti maj\U000000edc\U000000ed z\U000000e1jem (a tak\U000000e9 p\U00000159edpoklady prok\U000000e1zan\U000000e9 aspo\U00000148 trochou p\U00000159edchoz\U000000edch v\U000000fdsledk\U0000016f) pokra\U0000010dovat ve v\U0000011bdeck\U000000e9 kari\U000000e9\U00000159e v n\U0000011bkter\U000000e9m mi bl\U000000edzk\U000000e9m sm\U0000011bru jsou v\U00000159ele v\U000000edt\U000000e1ni na doktorsk\U000000e9m stupni studia pod m\U000000fdm veden\U000000edm. Sta\U0000010d\U000000ed se pod\U000000edvat na aktu\U000000e1ln\U000000ed t\U000000e9mata a zam\U0000011b\U00000159en\U000000ed na\U00000161eho v\U000000fdzkumu \U0000010di p\U00000159ij\U000000edt s vlastn\U000000edm podn\U0000011btn\U000000fdm n\U000000e1padem na v\U000000fdzkum.
V sou\U0000010dasnosti \U00000161kolen\U000000ed studenti: seznam.
\U00000160ikovn\U000000ed studenti maj\U000000ed mo\U0000017enost z\U000000edskat nadstandardn\U000000ed stipendium 29000CZK (kter\U000000e9 d\U000000e1le m\U000000edrn\U0000011b poroste).
K doktorsk\U000000e9mu studiu (intern\U000000edmu se stipendiem) na FI MU Brno lze nastupovat v zim\U0000011b i v l\U000000e9t\U0000011b a p\U00000159ij\U000000edmac\U000000ed procedura je po domluv\U0000011b se \U00000161kolitelem pom\U0000011brn\U0000011b neform\U000000e1ln\U000000ed.

V\U000000fdzkumn\U000000e9 \U000000fasp\U0000011bchy student\U0000016f

Cena rektora MU:
J. Gajarsk\U000000fd, 2016 Cena rektora pro vynikaj\U000000edc\U000000ed studenty doktorsk\U000000fdch studijn\U000000edch program\U0000016f.
J. Gajarsk\U000000fd, 2017 Cena rektora za vynikaj\U000000edc\U000000ed dizerta\U0000010dn\U000000ed pr\U000000e1ci.
Studentsk\U000000e1 v\U0000011bdeck\U000000e1 sout\U0000011b\U0000017e v matematice a informatice SVOČ:
1. ceny R. Ganian (2008), J. Balabán and J. Jedelský (2022),
2. ceny O. Moriš (2008), M. Derka (2010), M. Klusáček (2011), J. Gajarsk\U000000fd (2012), M. Bezek (2016).
Studentsk\U000000e9 granty na MU (Program rektora)
R. Ganian 2009-11, M. Derka 2010-11.
Nejlep\U00000161\U000000ed studentsk\U000000e9 \U0000010dl\U000000e1nky konferenc\U000000ed:
SOFSEM 2011 (R. Ganian), MEMICS 2011 (O. Moriš), CSR 2020 (O. Cagirici).
Vybran\U000000e9 ned\U000000e1vn\U000000e9 publikace s m\U000000fdmi studenty mezi spoluatory:
- 2024 (co-authors J. Balabán, J. Jedelský): Twin-width and Transductions of Proper k-Mixed-Thin Graphs. Discrete Mathematics 347 (2024), 113876. URL: arxiv.org/abs/2202.12536. DOI 10.1016/j.disc.2024.113876.
- 2024 (co-authors O. Cagirici, B. Roy): On Colourability of Polygon Visibility Graphs. European J. Combinatorics 117 (2024), 103820. URL: arxiv.org/abs/1906.01904. DOI 10.1016/j.ejc.2023.103820.
- 2023 (co-author D. Agaoglu Cagirici): Efficient Isomorphism for Sd-graphs and T-graphs. Algorithmica 85 (2023), 352--383. URL: arxiv.org/abs/1907.01495. DOI 10.1007/s00453-022-01033-8.
- 2023 (co-author A. Straka): Stack and Queue Numbers of Graphs Revisited. In: Eurocomb'23, Proceedings, Masaryk University Press (2023), 601--606. URL: arxiv.org/abs/2303.10116. DOI 10.5817/CZ.MUNI.EUROCOMB23-083.
- 2023 (co-authors D. Agaoglu Cagirici, O. Cagirici, J. Derbisz, T.A. Hartmann, J. Kratochvíl, T. Krawczyk, P. Zeman): Recognizing H-Graphs - Beyond Circular-Arc Graphs. In: MFCS 2023, LIPiCS Vol. 272, Dagstuhl (2023), 8:1--8:14. URL: arxiv.org/abs/2212.05433. DOI 10.4230/LIPIcs.MFCS.2023.8.
- 2023 (co-authors O. Cagirici, F. Pokrývka, A. Sankaran): Clique-Width of Point Configurations. J. of Combinatorial Theory ser. B 158 (2023), 43--73. URL: arxiv.org/abs/2004.02282. DOI 10.1016/j.jctb.2021.09.001.
- 2023 (co-author J. Jedelský): Twin-width of Planar Graphs is at most 8, and at most 6 when Bipartite Planar. In: ICALP 2023, LIPiCS Vol. 261, Dagstuhl (2023), 75:1--75:18. URL: arxiv.org/abs/2210.08620. DOI 10.4230/LIPIcs.ICALP.2023.75.
- 2019 (co-authors F. Pokrývka, B. Roy): FO model checking of geometric graphs. Computational Geometry: Theory and Applications 78 (2019), 1--19. URL: arxiv.org/abs/1709.03701. DOI 10.1016/j.comgeo.2018.10.001. © Elsevier B.V.
- 2016 (co-authors J. Gajarský, D. Lokshtanov, J. Obdržálek, M.S. Ramanujan): A New Perspective on FO Model Checking of Dense Graph Classes. In: LICS 2016, ACM (2016), 176--184. DOI 10.1145/2933575.2935314. Preprint/file.
- 2016 (co-author M. Derňár): Crossing Number is Hard for Kernelization. In: SoCG 2016, LIPIcs Vol. 51, Dagstuhl (2016), 42:1--42:10. URL: arxiv.org/abs/1512.02379. DOI 10.4230/LIPIcs.SoCG.2016.42.
- 2015 (co-authors J. Gajarský, D. Lokshtanov, J. Obdržálek, S. Ordyniak, M.S. Ramanujan, S. Saurabh): FO Model Checking on Posets of Bounded Width. In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, IEEE (2015), 963--974. URL: arxiv.org/abs/1504.04115. DOI 10.1109/FOCS.2015.63.