Workshop on Graph-Theoretic Concepts in Computer Science  - WG

领  域:  算法与理论
主  页:  http://www.ourglocal.com/url/?url=www.wg2011.cz%2F

论文统计图
相关事件


最新的论文更多>>
Rolling Upward Planarity Testing of Strongly Connected Graphs  
Christopher Auer , Christian Bachmaier , Franz-josef Brandenburg , Kathrin Hanauer
Workshop on Graph-Theoretic Concepts in Computer Science  2013
0次引用 0 0
The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube  
Luerbio Faria , Celina M. Herrera De Figueiredo , R. Bruce Richter , Imrich Vrto
Workshop on Graph-Theoretic Concepts in Computer Science  2013
0次引用 0 0
Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs  
Kathrin Hanauer , Franz-josef Brandenburg , Christopher Auer
Workshop on Graph-Theoretic Concepts in Computer Science  2013
0次引用 0 0
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs  
Hajo Broersma , Jiri Fiala , Petr A. Golovach , Tomas Kaiser , Daniel Paulusma , Andrzej Proskurowski
Workshop on Graph-Theoretic Concepts in Computer Science  2013
0次引用 0 0
Overview of New Approaches for Approximating TSP  
Ola Svensson
Workshop on Graph-Theoretic Concepts in Computer Science  2013
0次引用 0 0
 录用率: 参会人数: 影响力:
投稿方向:
会议点评
还没有人点评哦
主要作者
Hans Leo Bodlaender
Utrecht University
 
Dieter Kratsch
Paul Verlaine University – Metz
 
Jan Kratochvil
Charles University
 
Jan Arne Telle
University of Bergen
 
Ton Kloks
University of Leeds
 
主要概念
Feedback
Feedback
Feedback
我想反馈:
排行榜