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. Weighted coloring: on planar bipartite and split graphs: complexity and improved approximation
 
conference paper

Weighted coloring: on planar bipartite and split graphs: complexity and improved approximation

de Werra, D.  
•
Demange, M.
•
Escoffier, B.
Show more
2004
Algorithms and Computations
15th International Symposium, ISAAC 2004
  • Details
  • Metrics
Type
conference paper
DOI
10.1007/978-3-540-30551-4_76
Web of Science ID

WOS:000226690300074

Author(s)
de Werra, D.  
Demange, M.
Escoffier, B.
Monnot, J.
Paschos, V. T.
Date Issued

2004

Publisher

Springer Verlag

Published in
Algorithms and Computations
Series title/Series vol.

Lecture Notes in Computer Science; 3341

Start page

896

End page

907

Written at

EPFL

EPFL units
ROSE  
Event nameEvent placeEvent date
15th International Symposium, ISAAC 2004

Hong Kong, China

December 20-22, 2004

Available on Infoscience
August 16, 2006
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/233067
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