Markus Chimani

Navedeno

	Vse	Od leta 2019
Navedbe	1924	808
indeks h	24	13
indeks i10	64	24

160

120

200620072008200920102011201220132014201520162017201820192020202120222023202418 14 38 64 63 76 84 154 108 104 99 109 125 138 139 131 137 141 119

Javni dostop

Prikaži vse

33 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Petra MutzelProfessorin für Informatik, Universität BonnPreverjeni e-poštni naslov na cs.uni-bonn.de
Petr HlinenyMasaryk University, Brno, CZPreverjeni e-poštni naslov na fi.muni.cz
Gunnar W. KlauHeinrich Heine University DüsseldorfPreverjeni e-poštni naslov na hhu.de
Ivana LjubicProfessor of Operations Research, ESSEC Business School, ParisPreverjeni e-poštni naslov na essec.edu
Sebastian BöckerProfessor für Bioinformatik, FSU JenaPreverjeni e-poštni naslov na uni-jena.de
Fabrizio MontecchianiAssociate Professor, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Charles RichProfessor of Computer Science, Worcester Polytechnic InstitutePreverjeni e-poštni naslov na wpi.edu
Ioannis G. TollisProfessor of Computer Science, Univ. of CretePreverjeni e-poštni naslov na csd.uoc.gr
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgPreverjeni e-poštni naslov na uni-wuerzburg.de
Philipp HungerländerAssociated Professor, Alpen-Adria-Universität KlagenfurtPreverjeni e-poštni naslov na aau.at
Walter DidimoProfessor, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Joachim SpoerhaseDepartment of Computer Science, University of Liverpool, UKPreverjeni e-poštni naslov na liverpool.ac.uk
Carla BinucciUniversity of PerugiaPreverjeni e-poštni naslov na unipg.it
Giuseppe LiottaProfessor of Computer Science, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaPreverjeni e-poštni naslov na kam.mff.cuni.cz
Therese BiedlUniversity of WaterlooPreverjeni e-poštni naslov na cs.uwaterloo.ca
Jan-Henrik HaunertUniversity of BonnPreverjeni e-poštni naslov na igg.uni-bonn.de
Thomas C. van DijkRuhr-Universität BochumPreverjeni e-poštni naslov na rub.de
Fabrizio FratiFull Professor, Roma Tre UniversityPreverjeni e-poštni naslov na dia.uniroma3.it
Giuseppe Di BattistaDipartimento di Ingegneria Università Roma TrePreverjeni e-poštni naslov na dia.uniroma3.it

Spremljaj

Markus Chimani

Professor for Theoretical Computer Science, Uni Osnabrück, Germany

Preverjeni e-poštni naslov na uni-osnabrueck.de - Domača stran


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
The Open Graph Drawing Framework (OGDF). M Chimani, C Gutwenger, M Jünger, GW Klau, K Klein, P Mutzel Handbook of graph drawing and visualization 2011, 543-569, 2013	220	2013
Traffic engineering using segment routing and considering requirements of a carrier IP network T Schüller, N Aschenbruck, M Chimani, M Horneffer, S Schnitter IEEE/ACM Transactions on Networking 26 (4), 1851-1864, 2018	60	2018
A new approach to exact crossing minimization M Chimani, P Mutzel, I Bomze European Symposium on Algorithms, 284-296, 2008	56	2008
A branch-and-cut approach to the crossing number problem C Buchheim, M Chimani, D Ebner, C Gutwenger, M Jünger, GW Klau, ... Discrete Optimization 5 (2), 373-388, 2008	55	2008
Crossings and Planarization. C Buchheim, M Chimani, C Gutwenger, M Jünger, P Mutzel Handbook of Graph Drawing and Visualization, 43-85, 2013	53	2013
Improved Steiner tree algorithms for bounded treewidth M Chimani, P Mutzel, B Zey Journal of Discrete Algorithms 16, 67-78, 2012	49	2012
Obtaining optimal k-cardinality trees fast M Chimani, M Kandyba, I Ljubić, P Mutzel Journal of Experimental Algorithmics (JEA) 14, 2.5-2.23, 2010	47	2010
The open graph drawing framework M Chimani, C Gutwenger, M Jünger, K Klein, P Mutzel, M Schulz 15th International Symposium on Graph Drawing, 23-26, 2007	47	2007
An SDP approach to multi-level crossing minimization M Chimani, P Hungerländer, M Jünger, P Mutzel Journal of Experimental Algorithmics (JEA) 17, 3.1-3.26, 2012	42	2012
Inserting a vertex into a planar graph M Chimani, C Gutwenger, P Mutzel, C Wolf Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009	38	2009
An ILP-based proof system for the crossing number problem M Chimani, T Wiedera 24th annual European symposium on algorithms (ESA 2016), 2016	36	2016
A closer look at the closest string and closest substring problem M Chimani, M Woste, S Böcker 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and …, 2011	35	2011
Crossing minimization meets simultaneous drawing M Chimani, M Junger, M Schulz 2008 IEEE Pacific Visualization Symposium, 33-40, 2008	33	2008
Layer-free upward crossing minimization M Chimani, C Gutwenger, P Mutzel, HM Wong Journal of Experimental Algorithmics (JEA) 15, 2.1-2.27, 2010	32	2010
Non-planar core reduction of graphs M Chimani, C Gutwenger Discrete Mathematics 309 (7), 1838-1855, 2009	32	2009
Computing crossing numbers M Chimani Dortmund University, Germany, 2009	31	2009
Approximating the crossing number of graphs embeddable in any orientable surface P Hliněný, M Chimani Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	28	2010
Exact ILP solutions for phylogenetic minimum flip problems M Chimani, S Rahmann, S Böcker Proceedings of the First ACM International Conference on Bioinformatics and …, 2010	27	2010
Orientation-based models for {0, 1, 2}-survivable network design: Theory and practice M Chimani, M Kandyba, I Ljubić, P Mutzel Mathematical programming 124 (1), 413-439, 2010	27	2010
Failure resiliency with only a few tunnels–enabling segment routing for traffic engineering T Schüller, N Aschenbruck, M Chimani, M Horneffer IEEE/ACM Transactions on Networking 29 (1), 262-274, 2020	26	2020

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji