default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID38. WG 2012: Jerusalem, Israel
- Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern:
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. Lecture Notes in Computer Science 7551, Springer 2012, ISBN 978-3-642-34610-1
Invited Talks (Abstracts)
- Dieter Rautenbach:
Account on Intervals. 1 - David Peleg:
Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance. 2 - Amitava Bhattacharya:
Alternating Reachability and Integer Sum of Closed Alternating Trails - The 3rd Annual Uri N. Peled Memorial Lecture. 3
Poster Session
- Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern:
Student Poster Session. 4-6
Papers
- Anne Berry, Annegret K. Wagler:
Triangulation and Clique Separator Decomposition of Claw-Free Graphs. 7-21 - Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels:
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs. 22-33 - Stefan Kratsch, Pascal Schweitzer
:
Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs. 34-45 - Danny Hermelin, Julián Mestre, Dror Rawitz:
Optimization Problems in Dotted Interval Graphs. 46-56 - Mathew C. Francis, Daniel Gonçalves, Pascal Ochem:
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract). 57-68 - Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma:
Solutions for the Stable Roommates Problem with Payments. 69-80 - Daniel Berend, Amir Sapir:
Which Multi-peg Tower of Hanoi Problems Are Exponential? 81-90 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. 91-102 - Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer:
The Duals of Upward Planar Graphs on Cylinders. 103-113 - Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. 114-125 - Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski:
Determining the L(2, 1)-Span in Polynomial Space. 126-137 - Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On the Minimum Degree Up to Local Complementation: Bounds and Complexity. 138-147 - Haiko Müller:
On the Stable Degree of Graphs. 148-159 - Lukasz Kowalik, Marcin Mucha:
A 9k Kernel for Nonseparating Independent Set in Planar Graphs. 160-171 - Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Parameterized Algorithms for Even Cycle Transversal. 172-183 - Matthias Mnich, Rico Zenklusen:
Bisections above Tight Lower Bounds. 184-193 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk:
On Group Feedback Vertex Set Parameterized by the Size of the Cutset. 194-205 - Gilad Braunschvig, Shiri Chechik, David Peleg:
Fault Tolerant Additive Spanners. 206-214 - Tomoya Hibi, Toshihiro Fujito:
Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications. 215-224 - Neele Leithäuser, Sven Oliver Krumke, Maximilian Merkert:
Approximating Infeasible 2VPI-Systems. 225-236 - Robert H. Sloan, Despina Stasi, György Turán:
Hydras: Directed Hypergraphs and Horn Formulas. 237-248 - Sara Brunetti, Gennaro Cordasco, Luisa Gargano, Elena Lodi, Walter Quattrociocchi:
Minimum Weight Dynamo and Fast Opinion Spreading - (Extended Abstract). 249-261 - Carmen Cecilia Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá:
Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity. 262-273 - Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil:
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. 274-285 - Vadim E. Levit, Martin Milanic, David Tankus:
On the Recognition of k-Equistable Graphs. 286-296 - Fanica Gavril:
Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs. 297-307 - Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. 308-319 - Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
How to Eliminate a Graph. 320-331 - Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger:
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. 332-343
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-29 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
