Michael A. Bekos

引用先

	すべて	2020 年以来
引用	1773	952
h 指標	23	17
i10 指標	48	32

240

120

180

2005200620072008200920102011201220132014201520162017201820192020202120222023202420257 10 22 35 28 39 33 37 50 51 72 87 78 104 117 217 151 115 229 195 42

オープンアクセス

すべて表示

46 件の論文

2 件の論文

利用可能

利用不可

助成機関の要件に基づく

共著者

Michael KaufmannProfessor of Computer Science, Tübingen University確認したメールアドレス: uni-tuebingen.de
Antonios SymvonisNational Technical U. of Athens確認したメールアドレス: math.ntua.gr
Patrizio AngeliniJohn Cabot University確認したメールアドレス: dia.uniroma3.it
Martin GronemannNone確認したメールアドレス: uni-osnabrueck.de
Fabrizio MontecchianiAssociate Professor, University of Perugia確認したメールアドレス: unipg.it
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU Wien確認したメールアドレス: ac.tuwien.ac.at
Walter DidimoProfessor, University of Perugia確認したメールアドレス: unipg.it
Stephen KobourovProfessor of Computer Science, Technical University Munich確認したメールアドレス: tum.de
Sergey PupyrevApplied Research確認したメールアドレス: uran.ru
Philipp KindermannUniversität Trier確認したメールアドレス: uni-trier.de
Evmorfia N. ArgyriouyWorks GmbH確認したメールアドレス: math.ntua.gr
Giuseppe LiottaProfessor of Computer Science, University of Perugia確認したメールアドレス: unipg.it
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of Würzburg確認したメールアドレス: uni-wuerzburg.de
Ignaz RutterUniversity of Passau確認したメールアドレス: uni-passau.de
Katerina PotikaSan Jose State University確認したメールアドレス: sjsu.edu
Muhammad Jawaherul AlamPh.D., Computer Science, University of Arizona確認したメールアドレス: cs.arizona.edu
Sankar VeeramoniMeta確認したメールアドレス: meta.com

フォロー

Michael A. Bekos

Assistant Professor, Department of Mathematics, University of Ioannina, Greece

確認したメールアドレス: uoi.gr - ホームページ

Graph Algorithms Graph Drawing Map Labeling


タイトル引用回数順公開年順タイトル順	引用先引用先	年
Boundary labeling: Models and efficient algorithms for rectangular maps MA Bekos, M Kaufmann, A Symvonis, A Wolff Computational Geometry 36 (3), 215-236, 2007	154	2007
The straight-line RAC drawing problem is NP-hard EN Argyriou, MA Bekos, A Symvonis J. Graph Algorithms Appl. 16 (2), 569–597, 2012	80	2012
On the recognition of fan-planar and maximal outer-fan-planar graphs MA Bekos, S Cornelsen, L Grilli, SH Hong, M Kaufmann Algorithmica 79 (2), 401–427, 2017	56	2017
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	56	2010
The book thickness of 1-planar graphs is constant MA Bekos, T Bruckdorfer, M Kaufmann, CN Raftopoulou Algorithmica 79, 444-465, 2017	53*	2017
Four pages are indeed necessary for planar graphs MA Bekos, M Kaufmann, F Klute, S Pupyrev, C Raftopoulou, T Ueckerdt Journal of Computational Geomerty 11 (1), 332-353, 2020	52	2020
On optimal 2-and 3-planar graphs MA Bekos, M Kaufmann, CN Raftopoulou Symposium on Computational Geometry 77, 16:1--16:16, 2017	52	2017
Area-feature boundary labeling MA Bekos, M Kaufmann, K Potika, A Symvonis The Computer Journal 53 (6), 827-841, 2010	52*	2010
External labeling techniques: A taxonomy and survey MA Bekos, B Niedermann, M Nöllenburg Computer Graphics Forum 38 (3), 833-860, 2019	47*	2019
Two-page book embeddings of 4-planar graphs MA Bekos, M Gronemann, CN Raftopoulou Algorithmica 75, 158-185, 2016	46	2016
Maximizing the total resolution of graphs EN Argyriou, MA Bekos, A Symvonis The Computer Journal 56 (7), 887–900, 2012	46	2012
Queue layouts of planar 3-trees JM Alam, MA Bekos, M Gronemann, M Kaufmann, S Pupyrev Algorithmica 82, 2564-2585, 2020	44	2020
Simple k-planar graphs are simple (k+ 1)-quasiplanar P Angelini, MA Bekos, FJ Brandenburg, G Da Lozzo, G Di Battista, ... Journal of Combinatorial Theory, Series B 142, 1-35, 2020	43*	2020
Smooth orthogonal layouts MA Bekos, M Kaufmann, SG Kobourov, A Symvonis J. Graph Algorithms Appl. 17 (5), 575-595, 2013	43	2013
Line crossing minimization on metro maps MA Bekos, M Kaufmann, K Potika, A Symvonis Graph Drawing: 15th International Symposium, GD 2007, Sydney, Australia …, 2008	43	2008
On RAC drawings of 1-planar graphs MA Bekos, W Didimo, G Liotta, S Mehrabi, F Montecchiani Theoretical Computer Science 689, 48-57, 2017	39	2017
Many-to-one boundary labeling with backbones MA Bekos, S Cornelsen, M Fink, SH Hong, M Kaufmann, M Nöllenburg, ... J. Graph Algorithms Appl. 19 (3), 779-816, 2015	34	2015
Geometric RAC simultaneous drawings of graphs E Argyriou, M Bekos, M Kaufmann, A Symvonis Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012	29	2012
Graph product structure for h-framed graphs MA Bekos, G Da Lozzo, P Hliněný, M Kaufmann arXiv preprint arXiv:2204.11495, 2022	28	2022
Multi-stack boundary labeling problems MA Bekos, M Kaufmann, K Potika, A Symvonis FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006	28	2006

現在システムで処理を実行できません。しばらくしてからもう一度お試しください。

論文 1–20

年間引用数

重複した引用

結合された引用

共著者を追加共著者

フォロー

引用先

共著者