Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree
 
conference paper

Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree

Angelini, Patrizio
•
Di Battista, Giuseppe
•
Frati, Fabrizio  
Show more
2011
Combinatorial Algorithms (IWOCA '10)
21st International Workshop on Combinatorial Algorithms (IWOCA '10)
  • Details
  • Metrics
Type
conference paper
DOI
10.1007/978-3-642-19222-7_22
Author(s)
Angelini, Patrizio
Di Battista, Giuseppe
Frati, Fabrizio  
Patrignani, Maurizio
Rutter, Ignaz
Date Issued

2011

Published in
Combinatorial Algorithms (IWOCA '10)
Series title/Series vol.

Lecture Notes in Computer Science; 6460

Start page

212

End page

225

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
DCG  
Event nameEvent placeEvent date
21st International Workshop on Combinatorial Algorithms (IWOCA '10)

London, UK

July 26-28, 2010

Available on Infoscience
November 26, 2010
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/59209
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés