%0 Conference Paper %1 conf/dagstuhl/LeR07 %A Le, Van Bang %A de Ridder, H. N. %B Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes %D 2007 %E Brandstädt, Andreas %E Jansen, Klaus %E Kratsch, Dieter %E Spinrad, Jeremy P. %I Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany %K dblp %T Linear-time certifying recognition for partitioned probe cographs. %U http://dblp.uni-trier.de/db/conf/dagstuhl/P7211.html#LeR07 %V 07211

@inproceedings{conf/dagstuhl/LeR07, added-at = {2018-08-23T00:00:00.000+0200}, author = {Le, Van Bang and de Ridder, H. N.}, biburl = {https://www.bibsonomy.org/bibtex/293590534396fe99a9822d7fae31f7a90/dblp}, booktitle = {Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes}, crossref = {conf/dagstuhl/2007P7211}, editor = {Brandstädt, Andreas and Jansen, Klaus and Kratsch, Dieter and Spinrad, Jeremy P.}, ee = {http://drops.dagstuhl.de/opus/volltexte/2007/1270}, interhash = {2d2d092903df79679aa28e9e38227fac}, intrahash = {93590534396fe99a9822d7fae31f7a90}, keywords = {dblp}, publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany}, series = {Dagstuhl Seminar Proceedings}, timestamp = {2024-04-09T10:23:24.000+0200}, title = {Linear-time certifying recognition for partitioned probe cographs.}, url = {http://dblp.uni-trier.de/db/conf/dagstuhl/P7211.html#LeR07}, volume = 07211, year = 2007 }