Abstract
The 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2014) was held in Nouan-le-Fuzelier near Orleans, France on June 25–27. The WG2014 ProgramCommittee selected 32 high-quality papers among 80 submissions, for presentation at the conference and publication in the conference proceedings. Three of those papers, among the best ones,were proposed by the PCofWG2014 for possible publication as selected papers in Algorithmica. It turns out that the subjects of the selected papers nicely illustrate some of the main, classical topics ofWG conferences: structure of graph classes, graph algorithms and width parameters. The three papers went through a standard refereeing process of Algorithmica before being accepted for publication in this issue: • Boxicity and Separation Dimension by Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew and Deepak Rajendraprasad • A new characterization of Pk-free graphs by Eglantine Camby and Oliver Schaudt • Between Treewidth and Clique-Width by Sigve Hortemo Saether and Jan Arne Telle.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
