Michael Lampis
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 60
- Complexity and Algorithms in Graphs 41
- Graph Labeling and Dimension Problems 12
- Formal Methods in Verification 7
-
- Interconnection Networks and Systems 10
- Optimization and Search Problems 8
- Constraint Satisfaction and Optimization 8
- Co-authors
- John Andrews (1 shared paper)Sebastian Ordyniak (3 shared papers)Vangélis Th. Paschos (12 shared papers)Eun Jung Kim (6 shared papers)Yota Otachi (8 shared papers)Gregory Gutin (1 shared paper)Marek Karpiński (1 shared paper)Henning Fernau (3 shared papers)
- Journals
- Theoretical Computer Science (5 papers)Algorithmica (4 papers)Discrete Mathematics & Theoretical Computer Science (4 papers)Theory of Computing Systems (4 papers)Discrete Applied Mathematics (3 papers)
- Partner nations
- FranceJapanUnited States
In The Last Decade
Michael Lampis
66 papers receiving 609 citations
Peers
Comparison fields: 5 of 58
- Computational Theory and Mathematics 487
- Discrete Mathematics and Combinatorics 50
- Computer Graphics and Computer-Aided Design 33
- Computer Networks and Communications 212
- Statistics, Probability and Uncertainty 60
Countries citing papers authored by Michael Lampis
This map shows the geographic impact of Michael Lampis's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Lampis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Lampis more than expected).
Fields of papers citing papers by Michael Lampis
This network shows the impact of papers produced by Michael Lampis. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Lampis. The network helps show where Michael Lampis may publish in the future.
Co-authors
The 25 scholars most cited alongside Michael Lampis, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 79 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 137 | |
| 2 | 2008 | 76 | |
| 3 | Parameterized Algorithms for Modular-Width | 2013 | 46 |
| 4 | 2017 | 31 | |
| 5 | 2018 | 26 | |
| 6 | 2010 | 23 | |
| 7 | 2010 | 17 | |
| 8 | 2013 | 16 | |
| 9 | 2020 | 15 | |
| 10 | 2010 | 15 | |
| 11 | 2011 | 14 | |
| 12 | 2013 | 14 | |
| 13 | 2014 | 11 | |
| 14 | 2014 | 10 | |
| 15 | 2020 | 9 | |
| 16 | 2008 | 9 | |
| 17 | 2017 | 9 | |
| 18 | 2020 | 9 | |
| 19 | 2014 | 7 | |
| 20 | 2006 | 6 |
About Michael Lampis
Michael Lampis is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics and Artificial Intelligence, having authored 79 papers that have together received 625 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (60 papers), Complexity and Algorithms in Graphs (41 papers), Graph Labeling and Dimension Problems (12 papers), Computational Geometry and Mesh Generation (10 papers), Interconnection Networks and Systems (10 papers), Optimization and Search Problems (8 papers), Constraint Satisfaction and Optimization (8 papers) and Formal Methods in Verification (7 papers). The work is most often cited by research in Computational Theory and Mathematics (487 citations), Discrete Mathematics and Combinatorics (50 citations), Computer Graphics and Computer-Aided Design (33 citations), Computer Networks and Communications (212 citations) and Statistics, Probability and Uncertainty (60 citations). Michael Lampis has collaborated with scholars based in France, Japan and United States. Frequent co-authors include John Andrews, Sebastian Ordyniak, Vangélis Th. Paschos, Eun Jung Kim, Yota Otachi, Gregory Gutin, Marek Karpiński, Henning Fernau, Ljiljana Branković and Jérôme Monnot. Their work appears in journals such as Theoretical Computer Science, Algorithmica, Discrete Mathematics & Theoretical Computer Science, Theory of Computing Systems and Discrete Applied Mathematics.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.