András Sebö
Impact in
-
- Limits and Structures in Graph Theory
-
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 16
- Complexity and Algorithms in Graphs 11
- Graph Labeling and Dimension Problems 4
-
- Optimization and Packing Problems 4
- Vehicle Routing Optimization Methods 3
- Co-authors
- Éric TannierJens VygenMyriam PreissmannGábor N. SárközyStanley M. SelkowVincent JostMaurice QueyranneGerd Finke
In The Last Decade
András Sebö
25 papers receiving 643 citations
Peers
Comparison fields: 5 of 51
- Discrete Mathematics and Combinatorics 119
- Computational Theory and Mathematics 593
- Geometry and Topology 161
- Industrial and Manufacturing Engineering 92
- Computer Graphics and Computer-Aided Design 30
Countries citing papers authored by András Sebö
This map shows the geographic impact of András Sebö'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 András Sebö with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites András Sebö more than expected).
Fields of papers citing papers by András Sebö
This network shows the impact of papers produced by András Sebö. 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 András Sebö. The network helps show where András Sebö may publish in the future.
Co-authors
The 24 scholars most cited alongside András Sebö, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2021 | 0 | |
| 2 | 2014 | 2 | |
| 3 | Shorter Tours by Nicer Ears | 2012 | 7 |
| 4 | 2010 | 1 | |
| 5 | 2009 | 45 | |
| 6 | 2008 | 10 | |
| 7 | 2007 | 39 | |
| 8 | 2006 | 8 | |
| 9 | 1998 | 35 | |
| 10 | 1997 | 12 | |
| 11 | 1997 | 2 | |
| 12 | On Multiflow Problems. | 1992 | 1 |
| 13 | Forcing Colorations and the Strong Perfect Graph Conjecture. | 1992 | 3 |
| 14 | 1991 | 2 | |
| 15 | Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization | 1990 | 38 |
| 16 | On the Clique-Rank and the Coloration of Perfect Graphs | 1990 | 7 |
| 17 | 1988 | 11 | |
| 18 | 1987 | 9 | |
| 19 | 1986 | 6 | |
| 20 | 1985 | 16 |
About András Sebö
András Sebö is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design and Numerical Analysis, having authored 27 papers that have together received 709 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (16 papers), Complexity and Algorithms in Graphs (11 papers), Optimization and Search Problems (7 papers), graph theory and CDMA systems (5 papers), Graph Labeling and Dimension Problems (4 papers), Optimization and Packing Problems (4 papers), Markov Chains and Monte Carlo Methods (3 papers) and Vehicle Routing Optimization Methods (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (119 citations), Computational Theory and Mathematics (593 citations), Geometry and Topology (161 citations), Industrial and Manufacturing Engineering (92 citations) and Computer Graphics and Computer-Aided Design (30 citations). András Sebö has collaborated with scholars based in France, Hungary and Germany. Frequent co-authors include Éric Tannier, Jens Vygen, Myriam Preissmann, Gábor N. Sárközy, Stanley M. Selkow, Vincent Jost, Maurice Queyranne, Gerd Finke, Gábor Bacsó and András Gyárfás. Their work appears in journals such as Mathematical Programming, COMBINATORICA, Journal of Combinatorial Theory Series B, SIAM Journal on Discrete Mathematics 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.