Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8--10, 2020, Proceedings

From MaRDI portal
Publication:2042057
Jump to:navigation, search

DOI10.1007/978-3-030-48966-3zbMath1496.68019OpenAlexW4376597565MaRDI QIDQ2042057

No author found.

Publication date: 26 July 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48966-3



Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Discrete mathematics in relation to computer science (68Rxx)


Related Items (3)

The space complexity of sum labelling ⋮ Finding geometric representations of apex graphs is NP-hard ⋮ The space complexity of sum labelling






This page was built for publication: Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8--10, 2020, Proceedings

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2042057&oldid=14513795"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 19:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki