Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarElectronic Notes in Discrete Mathematics, Volume 32
Volume 32, March 2009
- Domingos Moreira Cardoso, Sofia J. Pinheiro:
Spectral upper bounds on the size of k-regular induced subgraphs. 3-10 - Carmen C. Centeno, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
On the Convexity of Paths of Length Two in Undirected Graphs. 11-18 - Vladimir G. Deineko, Alexander Tiskin:
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. 19-26 - Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
A new representation of proper interval graphs with an application to clique-width. 27-34 - Alexander Grigoriev, Bert Marchal, Natalya Usotskaya:
On planar graphs with large tree-width and small grid minors. 35-42 - Ignasi Sau, Dimitrios M. Thilikos:
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs. 59-66 - Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
Asteroids in rooted and directed path graphs. 67-74 - Gregory Z. Gutin:
Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems. 75-82 - Michel Habib, Juraj Stacho:
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage. 99-108 - David Coudert, Dorian Mazauric, Nicolas Nisse:
On Rerouting Connection Requests in Networks with Shared Bandwidth. 109-116 - Feodor F. Dragan, Yang Xiang, Chenyu Yan:
Collective Tree Spanners for Unit Disk Graphs with Applications. 117-124 - Nicholas Korpelainen:
A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs. 133-140
last updated on 2019-05-23 00:14 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
