×
Author ID: lampis.michael Recent zbMATH articles by "Lampis, Michael"
Published as: Lampis, Michael; Lampis, M.
External Links: MGP

Publications by Year

Citations contained in zbMATH Open

68 Publications have been cited 490 times in 349 Documents Cited by Year
Algorithmic meta-theorems for restrictions of treewidth. Zbl 1252.68154
Lampis, Michael
85
2012
Parameterized algorithms for modular-width. Zbl 1406.68080
Gajarský, Jakub; Lampis, Michael; Ordyniak, Sebastian
56
2013
New inapproximability bounds for TSP. Zbl 1328.68076
Karpinski, Marek; Lampis, Michael; Schmied, Richard
24
2015
The many facets of upper domination. Zbl 1388.68099
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
22
2018
Multistage matchings. Zbl 1477.68196
Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael; Paschos, Vangelis Th.
18
2018
Vertex cover problem parameterized above and below tight bounds. Zbl 1209.68276
Gutin, Gregory; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia
15
2011
New inapproximability bounds for TSP. Zbl 1328.68075
Karpinski, Marek; Lampis, Michael; Schmied, Richard
13
2013
Parameterized approximation schemes using graph widths. Zbl 1410.68402
Lampis, Michael
12
2014
On the algorithmic effectiveness of digraph decompositions and complexity measures. Zbl 1248.90073
Lampis, Michael; Kaouri, Georgia; Mitsou, Valia
10
2011
Structurally parameterized \(d\)-scattered set. Zbl 1519.05103
Katsikarelis, Ioannis; Lampis, Michael; Th. Paschos, Vangelis
9
2018
Time-approximation trade-offs for inapproximable problems. Zbl 1380.68440
Bonnet, Édouard; Lampis, Michael; Paschos, Vangelis Th.
9
2018
Improved inapproximability for TSP. Zbl 1372.68115
Lampis, Michael
9
2012
Structural parameters, tight bounds, and approximation for \((k, r)\)-center. Zbl 1414.05102
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
9
2019
On the algorithmic effectiveness of digraph decompositions and complexity measures. Zbl 1183.68312
Lampis, Michael; Kaouri, Georgia; Mitsou, Valia
8
2008
A kernel of order \(2k-c\log k\) for vertex cover. Zbl 1260.05165
Lampis, Michael
8
2011
Algorithmic meta-theorems for restrictions of treewidth. Zbl 1287.68078
Lampis, Michael
8
2010
Token sliding on split graphs. Zbl 1517.68273
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota; Sikora, Florian
8
2021
Treewidth with a quantifier alternation revisited. Zbl 1443.68073
Lampis, Michael; Mitsou, Valia
7
2018
Upper domination: complexity and approximation. Zbl 1478.68099
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
7
2016
The computational complexity of the game of Set and its theoretical applications. Zbl 1405.68142
Lampis, Michael; Mitsou, Valia
7
2014
Token sliding on split graphs. Zbl 1517.68274
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota; Sikora, Florian
6
2019
Parameterized orientable deletion. Zbl 1477.68229
Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Otachi, Yota; Sikora, Florian
6
2018
Structural parameters, tight bounds, and approximation for \((k,r)\)-center. Zbl 1457.68126
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
6
2017
Algorithmic aspects of Upper Domination: a parameterised perspective. Zbl 1476.68114
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
6
2016
Model checking lower bounds for simple graphs. Zbl 1326.68152
Lampis, Michael
6
2014
Parameterized power vertex cover. Zbl 1401.05229
Angel, Eric; Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael
5
2018
Grundy distinguishes treewidth from pathwidth. Zbl 07651153
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota
5
2020
Time-approximation trade-offs for inapproximable problems. Zbl 1380.68441
Bonnet, Édouard; Lampis, Michael; Paschos, Vangelis Th.
5
2016
Parameterized edge Hamiltonicity. Zbl 1417.05115
Lampis, Michael; Makino, Kazuhisa; Mitsou, Valia; Uno, Yushi
5
2014
Online maximum directed cut. Zbl 1254.90270
Bar-Noy, Amotz; Lampis, Michael
5
2012
New results on directed edge dominating set. Zbl 1512.68191
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Kim, Eun Jung; Lampis, Michael
5
2018
On the parameterized complexity of red-blue points separation. Zbl 1423.68540
Bonnet, Edouard; Giannopoulos, Panos; Lampis, Michael
5
2019
The ferry cover problem. Zbl 1201.68157
Lampis, Michael; Mitsou, Valia
4
2007
Parameterized (approximate) defective coloring. Zbl 1487.68134
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia
4
2018
Independent set reconfiguration parameterized by modular-width. Zbl 1453.68124
Belmonte, Rémy; Hanaka, Tesshu; Lampis, Michael; Ono, Hirotaka; Otachi, Yota
4
2020
Parameterized complexity of safe set. Zbl 1447.05200
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota
4
2020
Parameterized power vertex cover. Zbl 1417.05157
Angel, Eric; Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael
4
2016
Structurally parameterized \(d\)-scattered set. Zbl 1479.05081
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
3
2022
Improved (In-)approximability bounds for \(d\)-scattered set. Zbl 07238568
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
3
2020
Parameterized complexity of safe set. Zbl 1525.68090
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota
3
2019
Parameterized (approximate) defective coloring. Zbl 1433.68178
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia
3
2020
Defective coloring on classes of perfect graphs. Zbl 1483.05172
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia
3
2017
Model checking lower bounds for simple graphs. Zbl 1336.68165
Lampis, Michael
3
2013
Improved inapproximability for TSP. Zbl 1366.68077
Lampis, Michael
3
2014
Ordered coloring of grids and related graphs. Zbl 1246.05052
Bar-Noy, Amotz; Cheilaris, Panagiotis; Lampis, Michael; Mitsou, Valia; Zachos, Stathis
3
2012
Finer tight bounds for coloring on clique-width. Zbl 1499.68282
Lampis, Michael
3
2018
Queen labelings. Zbl 1236.05172
Bloom, Gary; Lampis, Michael; Muntaner-Batle, F. A.; Rius-Font, M.
2
2011
Complexity and approximability of parameterized MAX-CSPs. Zbl 1372.68121
Dell, Holger; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Mömke, Tobias
2
2017
Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation. Zbl 07667131
Dublois, Louis; Lampis, Michael; Paschos, Vangelis Th.
2
2021
(In)approximability of maximum minimal FVS. Zbl 1478.68448
Dublois, Louis; Hanaka, Tesshu; Khosravian Ghadikolaei, Mehdi; Lampis, Michael; Melissinos, Nikolaos
2
2022
Sub-exponential approximation schemes for CSPs: from dense to almost sparse. Zbl 1388.68307
Fotakis, Dimitris; Lampis, Michael; Paschos, Vangelis Th.
2
2016
QBF as an alternative to Courcelle’s theorem. Zbl 1511.68128
Lampis, Michael; Mengel, Stefan; Mitsou, Valia
2
2018
Parameterized algorithms for parity games. Zbl 1465.68112
Gajarský, Jakub; Lampis, Michael; Makino, Kazuhisa; Mitsou, Valia; Ordyniak, Sebastian
2
2015
Complexity and approximability of parameterized MAX-CSPs. Zbl 1378.68071
Dell, Holger; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Mömke, Tobias
2
2015
Parameterized modal satisfiability. Zbl 1283.68157
Achilleos, Antonis; Lampis, Michael; Mitsou, Valia
2
2012
Parameterized maximum path coloring. Zbl 1407.68228
Lampis, Michael
2
2013
Parameterized edge Hamiltonicity. Zbl 1395.05098
Lampis, Michael; Makino, Kazuhisa; Mitsou, Valia; Uno, Yushi
2
2018
(In)approximability of maximum minimal FVS. Zbl 07765361
Dublois, Louis; Hanaka, Tesshu; Khosravian, Ghadikolaei Mehdi; Lampis, Michael; Melissinos, Nikolaos
2
2020
The ferry cover problem. Zbl 1176.90105
Lampis, Michael; Mitsou, Valia
1
2009
How bad is the freedom to Flood-It? Zbl 1489.05102
Belmonte, Rémy; Khosravian Ghadikolaei, Mehdi; Kiyomi, Masashi; Lampis, Michael; Otachi, Yota
1
2018
Maximum independent sets in subcubic graphs: new results. Zbl 1464.68286
Harutyunyan, Ararat; Lampis, Michael; Lozin, Vadim; Monnot, Jérôme
1
2019
On the parameterized complexity of red-blue points separation. Zbl 1443.68197
Bonnet, Édouard; Giannopoulos, Panos; Lampis, Michael
1
2018
Parameterized complexity of \((A,\ell)\)-path packing. Zbl 07495627
Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota
1
2022
Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation. Zbl 07540243
Dublois, Louis; Lampis, Michael; Paschos, Vangelis Th.
1
2022
Periodic metro scheduling. Zbl 1247.90152
Bampas, Evangelos; Kaouri, Georgia; Lampis, Michael; Pagourtzis, Aris
1
2006
Maximum independent sets in subcubic graphs: new results. Zbl 1464.68285
Harutyunyan, A.; Lampis, M.; Lozin, V.; Monnot, J.
1
2020
Online maximum directed cut. Zbl 1273.68415
Bar-Noy, Amotz; Lampis, Michael
1
2009
Ordered coloring grids and related graphs. Zbl 1274.68269
Bar-Noy, Amotz; Cheilaris, Panagiotis; Lampis, Michael; Mitsou, Valia; Zachos, Stathis
1
2010
Structurally parameterized \(d\)-scattered set. Zbl 1479.05081
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
3
2022
(In)approximability of maximum minimal FVS. Zbl 1478.68448
Dublois, Louis; Hanaka, Tesshu; Khosravian Ghadikolaei, Mehdi; Lampis, Michael; Melissinos, Nikolaos
2
2022
Parameterized complexity of \((A,\ell)\)-path packing. Zbl 07495627
Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota
1
2022
Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation. Zbl 07540243
Dublois, Louis; Lampis, Michael; Paschos, Vangelis Th.
1
2022
Token sliding on split graphs. Zbl 1517.68273
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota; Sikora, Florian
8
2021
Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation. Zbl 07667131
Dublois, Louis; Lampis, Michael; Paschos, Vangelis Th.
2
2021
Grundy distinguishes treewidth from pathwidth. Zbl 07651153
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota
5
2020
Independent set reconfiguration parameterized by modular-width. Zbl 1453.68124
Belmonte, Rémy; Hanaka, Tesshu; Lampis, Michael; Ono, Hirotaka; Otachi, Yota
4
2020
Parameterized complexity of safe set. Zbl 1447.05200
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota
4
2020
Improved (In-)approximability bounds for \(d\)-scattered set. Zbl 07238568
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
3
2020
Parameterized (approximate) defective coloring. Zbl 1433.68178
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia
3
2020
(In)approximability of maximum minimal FVS. Zbl 07765361
Dublois, Louis; Hanaka, Tesshu; Khosravian, Ghadikolaei Mehdi; Lampis, Michael; Melissinos, Nikolaos
2
2020
Maximum independent sets in subcubic graphs: new results. Zbl 1464.68285
Harutyunyan, A.; Lampis, M.; Lozin, V.; Monnot, J.
1
2020
Structural parameters, tight bounds, and approximation for \((k, r)\)-center. Zbl 1414.05102
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
9
2019
Token sliding on split graphs. Zbl 1517.68274
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota; Sikora, Florian
6
2019
On the parameterized complexity of red-blue points separation. Zbl 1423.68540
Bonnet, Edouard; Giannopoulos, Panos; Lampis, Michael
5
2019
Parameterized complexity of safe set. Zbl 1525.68090
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota
3
2019
Maximum independent sets in subcubic graphs: new results. Zbl 1464.68286
Harutyunyan, Ararat; Lampis, Michael; Lozin, Vadim; Monnot, Jérôme
1
2019
The many facets of upper domination. Zbl 1388.68099
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
22
2018
Multistage matchings. Zbl 1477.68196
Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael; Paschos, Vangelis Th.
18
2018
Structurally parameterized \(d\)-scattered set. Zbl 1519.05103
Katsikarelis, Ioannis; Lampis, Michael; Th. Paschos, Vangelis
9
2018
Time-approximation trade-offs for inapproximable problems. Zbl 1380.68440
Bonnet, Édouard; Lampis, Michael; Paschos, Vangelis Th.
9
2018
Treewidth with a quantifier alternation revisited. Zbl 1443.68073
Lampis, Michael; Mitsou, Valia
7
2018
Parameterized orientable deletion. Zbl 1477.68229
Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Otachi, Yota; Sikora, Florian
6
2018
Parameterized power vertex cover. Zbl 1401.05229
Angel, Eric; Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael
5
2018
New results on directed edge dominating set. Zbl 1512.68191
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Kim, Eun Jung; Lampis, Michael
5
2018
Parameterized (approximate) defective coloring. Zbl 1487.68134
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia
4
2018
Finer tight bounds for coloring on clique-width. Zbl 1499.68282
Lampis, Michael
3
2018
QBF as an alternative to Courcelle’s theorem. Zbl 1511.68128
Lampis, Michael; Mengel, Stefan; Mitsou, Valia
2
2018
Parameterized edge Hamiltonicity. Zbl 1395.05098
Lampis, Michael; Makino, Kazuhisa; Mitsou, Valia; Uno, Yushi
2
2018
How bad is the freedom to Flood-It? Zbl 1489.05102
Belmonte, Rémy; Khosravian Ghadikolaei, Mehdi; Kiyomi, Masashi; Lampis, Michael; Otachi, Yota
1
2018
On the parameterized complexity of red-blue points separation. Zbl 1443.68197
Bonnet, Édouard; Giannopoulos, Panos; Lampis, Michael
1
2018
Structural parameters, tight bounds, and approximation for \((k,r)\)-center. Zbl 1457.68126
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
6
2017
Defective coloring on classes of perfect graphs. Zbl 1483.05172
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia
3
2017
Complexity and approximability of parameterized MAX-CSPs. Zbl 1372.68121
Dell, Holger; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Mömke, Tobias
2
2017
Upper domination: complexity and approximation. Zbl 1478.68099
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
7
2016
Algorithmic aspects of Upper Domination: a parameterised perspective. Zbl 1476.68114
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
6
2016
Time-approximation trade-offs for inapproximable problems. Zbl 1380.68441
Bonnet, Édouard; Lampis, Michael; Paschos, Vangelis Th.
5
2016
Parameterized power vertex cover. Zbl 1417.05157
Angel, Eric; Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael
4
2016
Sub-exponential approximation schemes for CSPs: from dense to almost sparse. Zbl 1388.68307
Fotakis, Dimitris; Lampis, Michael; Paschos, Vangelis Th.
2
2016
New inapproximability bounds for TSP. Zbl 1328.68076
Karpinski, Marek; Lampis, Michael; Schmied, Richard
24
2015
Parameterized algorithms for parity games. Zbl 1465.68112
Gajarský, Jakub; Lampis, Michael; Makino, Kazuhisa; Mitsou, Valia; Ordyniak, Sebastian
2
2015
Complexity and approximability of parameterized MAX-CSPs. Zbl 1378.68071
Dell, Holger; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Mömke, Tobias
2
2015
Parameterized approximation schemes using graph widths. Zbl 1410.68402
Lampis, Michael
12
2014
The computational complexity of the game of Set and its theoretical applications. Zbl 1405.68142
Lampis, Michael; Mitsou, Valia
7
2014
Model checking lower bounds for simple graphs. Zbl 1326.68152
Lampis, Michael
6
2014
Parameterized edge Hamiltonicity. Zbl 1417.05115
Lampis, Michael; Makino, Kazuhisa; Mitsou, Valia; Uno, Yushi
5
2014
Improved inapproximability for TSP. Zbl 1366.68077
Lampis, Michael
3
2014
Parameterized algorithms for modular-width. Zbl 1406.68080
Gajarský, Jakub; Lampis, Michael; Ordyniak, Sebastian
56
2013
New inapproximability bounds for TSP. Zbl 1328.68075
Karpinski, Marek; Lampis, Michael; Schmied, Richard
13
2013
Model checking lower bounds for simple graphs. Zbl 1336.68165
Lampis, Michael
3
2013
Parameterized maximum path coloring. Zbl 1407.68228
Lampis, Michael
2
2013
Algorithmic meta-theorems for restrictions of treewidth. Zbl 1252.68154
Lampis, Michael
85
2012
Improved inapproximability for TSP. Zbl 1372.68115
Lampis, Michael
9
2012
Online maximum directed cut. Zbl 1254.90270
Bar-Noy, Amotz; Lampis, Michael
5
2012
Ordered coloring of grids and related graphs. Zbl 1246.05052
Bar-Noy, Amotz; Cheilaris, Panagiotis; Lampis, Michael; Mitsou, Valia; Zachos, Stathis
3
2012
Parameterized modal satisfiability. Zbl 1283.68157
Achilleos, Antonis; Lampis, Michael; Mitsou, Valia
2
2012
Vertex cover problem parameterized above and below tight bounds. Zbl 1209.68276
Gutin, Gregory; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia
15
2011
On the algorithmic effectiveness of digraph decompositions and complexity measures. Zbl 1248.90073
Lampis, Michael; Kaouri, Georgia; Mitsou, Valia
10
2011
A kernel of order \(2k-c\log k\) for vertex cover. Zbl 1260.05165
Lampis, Michael
8
2011
Queen labelings. Zbl 1236.05172
Bloom, Gary; Lampis, Michael; Muntaner-Batle, F. A.; Rius-Font, M.
2
2011
Algorithmic meta-theorems for restrictions of treewidth. Zbl 1287.68078
Lampis, Michael
8
2010
Ordered coloring grids and related graphs. Zbl 1274.68269
Bar-Noy, Amotz; Cheilaris, Panagiotis; Lampis, Michael; Mitsou, Valia; Zachos, Stathis
1
2010
The ferry cover problem. Zbl 1176.90105
Lampis, Michael; Mitsou, Valia
1
2009
Online maximum directed cut. Zbl 1273.68415
Bar-Noy, Amotz; Lampis, Michael
1
2009
On the algorithmic effectiveness of digraph decompositions and complexity measures. Zbl 1183.68312
Lampis, Michael; Kaouri, Georgia; Mitsou, Valia
8
2008
The ferry cover problem. Zbl 1201.68157
Lampis, Michael; Mitsou, Valia
4
2007
Periodic metro scheduling. Zbl 1247.90152
Bampas, Evangelos; Kaouri, Georgia; Lampis, Michael; Pagourtzis, Aris
1
2006
all top 5

Cited by 571 Authors

29 Lampis, Michael
15 Otachi, Yota
14 Hanaka, Tesshu
14 Knop, Dušan
11 Fomin, Fedor V.
10 Belmonte, Rémy
10 Fernau, Henning
10 Monnot, Jérôme
10 Paschos, Vangelis Th.
9 Feldmann, Andreas Emil
9 Golovach, Petr A.
9 Ito, Takehiro
9 Koutecký, Martin
8 Escoffier, Bruno
8 Ganian, Robert
8 Maity, Soumen
8 Mitsou, Valia
8 Zehavi, Meirav
7 Bampis, Evripidis
7 Casel, Katrin
7 Khosravian Ghadikolaei, Mehdi
7 Kobayashi, Yasuaki
7 Lozin, Vadim Vladislavovich
7 Niedermeier, Rolf
7 Saurabh, Saket
7 Toufar, Tomáš
6 Bousquet, Nicolas
6 Fluschnik, Till
6 Foucaud, Florent
6 Gargano, Luisa
6 Hliněný, Petr
6 Masařík, Tomáš
6 Ono, Hirotaka
6 Rescigno, Adele Anna
6 Rossmanith, Peter
6 Souza, Uéverton S.
5 Bartier, Valentin
5 Dublois, Louis
5 Gaikwad, Ajinkya
5 Gutin, Gregory Z.
5 Katsikarelis, Ioannis
5 Kim, Eun Jung
5 Mnich, Matthias
5 Mouawad, Amer E.
5 Obdržálek, Jan
5 Sikora, Florian
5 Yeo, Anders
5 Zschoche, Philipp
4 Alecu, Bogdan
4 Cordasco, Gennaro
4 Dallard, Clément
4 Eto, Hiroshi
4 Fellows, Michael Ralph
4 Gavenčiak, Tomáš
4 Jansen, Bart M. P.
4 Kiyomi, Masashi
4 Kneis, Joachim
4 Lehtilä, Tuomo
4 Marx, Dániel
4 Ordyniak, Sebastian
4 Oum, Sang-Il
4 Rosamond, Frances A.
4 Sau, Ignasi
4 Teiller, Alexandre
4 Vygen, Jens
4 Zamaraev, Victor A.
3 Abu-Khzam, Faisal N.
3 Agrawal, Akanksha
3 Bazgan, Cristina
3 Bonnet, Edouard
3 Branković, Ljiljana
3 de Werra, Dominique
3 Ducoffe, Guillaume
3 Dvořák, Pavel
3 Eiben, Eduard
3 Faria, Luerbio
3 Friedrich, Tobias
3 Gima, Tatsuya
3 Grandoni, Fabrizio
3 Gutekunst, Samuel C.
3 Hecher, Markus
3 Karpinski, Marek
3 Klasing, Ralf
3 Kobayashi, Yusuke
3 Kreutzer, Stephan
3 Kwon, O. joung
3 Langer, Alexander
3 Liedloff, Mathieu
3 Lokshtanov, Daniel
3 Mann, Kevin
3 Melissinos, Nikolaos
3 Nederlof, Jesper
3 Panolan, Fahad
3 Pedrosa, Lehilton Lelis Chaves
3 Reddy, I. Vinod
3 Reidl, Felix
3 Sæther, Sigve Hortemo
3 Sharma, Roohani
3 Sikdar, Somnath
3 Tripathi, Shuvam Kant
...and 471 more Authors
all top 5

Cited in 50 Serials

46 Theoretical Computer Science
32 Algorithmica
30 Discrete Applied Mathematics
20 Journal of Computer and System Sciences
17 SIAM Journal on Discrete Mathematics
9 Information Processing Letters
6 SIAM Journal on Computing
6 Journal of Combinatorial Optimization
5 Mathematical Programming. Series A. Series B
4 Discrete Mathematics
4 Journal of Graph Algorithms and Applications
4 Discrete Optimization
3 Journal of Combinatorial Theory. Series B
3 Networks
3 European Journal of Operational Research
3 Theory of Computing Systems
3 ACM Transactions on Algorithms
2 Artificial Intelligence
2 Mathematics of Operations Research
2 European Journal of Combinatorics
2 Graphs and Combinatorics
2 Information and Computation
2 Annals of Operations Research
2 Logical Methods in Computer Science
1 Fortschritte der Physik
1 International Journal of Game Theory
1 Journal of Graph Theory
1 Journal of Optimization Theory and Applications
1 Proceedings of the Japan Academy. Series A
1 Results in Mathematics
1 Chinese Annals of Mathematics. Series B
1 Computers & Operations Research
1 International Journal of Foundations of Computer Science
1 Proceedings of the Indian Academy of Sciences. Mathematical Sciences
1 SIAM Journal on Optimization
1 The Electronic Journal of Combinatorics
1 Annals of Mathematics and Artificial Intelligence
1 Mathematical Methods of Operations Research
1 Chicago Journal of Theoretical Computer Science
1 RAIRO. Operations Research
1 4OR
1 Journal of Discrete Algorithms
1 Algorithms
1 Mathematical Programming Computation
1 Computer Science Review
1 Journal of Mathematics
1 Electronic Journal of Graph Theory and Applications
1 Journal of Logical and Algebraic Methods in Programming
1 Ural Mathematical Journal
1 The Art of Discrete and Applied Mathematics

Citations by Year