%0 Conference Paper %1 conf/sofsem/AntoniadisL10 %A Antoniadis, Antonios %A Lingas, Andrzej %B SOFSEM %D 2010 %E van Leeuwen, Jan %E Muscholl, Anca %E Peleg, David %E Pokorný, Jaroslav %E Rumpe, Bernhard %I Springer %K %P 153-164 %T Approximability of Edge Matching Puzzles. %U http://dblp.uni-trier.de/db/conf/sofsem/sofsem2010.html#AntoniadisL10 %V 5901 %@ 978-3-642-11265-2

@inproceedings{conf/sofsem/AntoniadisL10, added-at = {2023-12-13T08:26:14.000+0100}, author = {Antoniadis, Antonios and Lingas, Andrzej}, biburl = {https://www.bibsonomy.org/bibtex/2e0c119ab64210c44ba21a04316e6487b/admin}, booktitle = {SOFSEM}, crossref = {conf/sofsem/2010}, editor = {van Leeuwen, Jan and Muscholl, Anca and Peleg, David and Pokorný, Jaroslav and Rumpe, Bernhard}, ee = {https://doi.org/10.1007/978-3-642-11266-9_13}, interhash = {c3a58fe4c0e271c6c85995475212a744}, intrahash = {e0c119ab64210c44ba21a04316e6487b}, isbn = {978-3-642-11265-2}, keywords = {}, pages = {153-164}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-13T08:26:14.000+0100}, title = {Approximability of Edge Matching Puzzles.}, url = {http://dblp.uni-trier.de/db/conf/sofsem/sofsem2010.html#AntoniadisL10}, volume = 5901, year = 2010 }