-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
120 lines (49 loc) · 3.9 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
<!DOCTYPE html>
<html lang="en">
<head>
<meta name="keywords" content="Ioannis,Panagiotas,ens,lyon,lip,roma,phd,computer,science,combinatorial,scientific,computing">
<meta name="description" content="Personal web page of Ioannis Panagiotas - PhD Student in Computer Science - ENS Lyon">
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<title>Ioannis Panagiotas</title>
</head>
<body>
<div >
<header>
<div >
<h1 >Ioannis Panagiotas</h1><h3 >
</div>
<div ></div>
</header>
</div>
</div>
<div >
<article >
<h2>About</h2>
<p>I am an <a href="https://www.inria.fr">INRIA</a>-funded PhD Student in the <a href="http://www.ens-lyon.fr/LIP/ROMA/">ROMA</a> team of the <a href="http://www.ens-lyon.fr/LIP">LIP</a> laboratory at the ENS de Lyon. My supervisor is <a href="http://perso.ens-lyon.fr/bora.ucar/">Bora Uçar</a>.
<p>My research is in the field of combinatorial scientific computing, focusing primarely on algorithms for matching related problems.
<p><strong>e-mail: </strong>ioannis.panagiotas[at]ens-lyon.fr<p></align>
</article>
<article >
<h2>Publications [<a href="https://scholar.google.gr/citations?user=fRGbhZgAAAAJ&hl=en">Google Scholar</a>]</h2>
<h3>2020</h3>
<ul>
<li><div class="publication"><strong>Scaling matrices and counting the perfect matchings in graphs</strong> [<a href="https://hal.inria.fr/hal-01743802/document">PDF</a>]<br> Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar </br><span class="booktitle"> <i> Inria Research Report 9161 / Accepted at Discrete Applied Mathematics</i></span> </li>
<li><div class="publication"><strong> Karp-Sipser based Kernels for Bipartite Graph Matching
</strong> [<a href="https://hal.inria.fr/hal-02350734/document">PDF</a>,<a href="https://gitlab.inria.fr/bora-ucar/karp--sipser-reduction">Codes</a>]<br>Kamer Kaya, Johannes Langguth, Ioannis Panagiotas, Bora Uçar </br><span class="booktitle"> <i>Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 134--145</i></span> </li>
<li><div class="publication"><strong> Engineering fast almost optimal algorithms for bipartite graph matching
</strong>[<a href="https://hal.inria.fr/hal-02463717/document">PDF</a>,<a href="https://gitlab.inria.fr/bora-ucar/fast-matching">Codes</a>]<br>Ioannis Panagiotas and Bora Uçar </br><span class="booktitle"> <i> INRIA Technical Report 9321/ Accepted for publication at ESA'20</i></span> </li>
</ul>
<h3>2019</h3>
<ul>
<li> <div class="publication"><strong>Effective heuristics for matchings in hypergraphs</strong> [<a href="https://hal.inria.fr/hal-02417475/document">PDF</a>,<a href="https://gitlab.inria.fr/ucar/karp-sipser-for-hypergraphs">Codes</a>]<br> Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar </br><span class="booktitle">
<i> SEA^2 2019 - International Symposium on Experimental Algorithms - Special Event, Jun 2019, Kalamata, Greece. pp.248-264,</i></span> </li>
</ul>
<h3>2018</h3>
<ul>
<li><div class="publication"><strong>Approximation algorithms for matchings in undirected graphs</strong> [<a href="https://hal.archives-ouvertes.fr/hal-01740403/document">PDF</a>]<br> Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar </br><span class="booktitle"> <i> Proceedings of CSC18, Bergen, Norway, June 6-8 2018, pp. 68--78</i></span> </li>
<li><div class="publication"><strong>Further notes on Birkhoff-von Neumann decompositions</strong> [<a href="https://hal.inria.fr/hal-01586245/document">PDF</a>]<br> Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar </br> <span class="booktitle"> <i> Linear algebra and its applications, Volume 554, pp. 56--65</i></span> </li>
</ul>
</article>
</div>
</body>
</html>