%0 Conference Paper %1 conf/stacs/LanlignelRT00 %A Lanlignel, Jean-Marc %A Raynaud, Olivier %A Thierry, Eric %B STACS %D 2000 %E Reichel, Horst %E Tison, Sophie %I Springer %K dblp %P 529-541 %T Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2000.html#LanlignelRT00 %V 1770 %@ 3-540-67141-2

@inproceedings{conf/stacs/LanlignelRT00, added-at = {2017-05-24T00:00:00.000+0200}, author = {Lanlignel, Jean-Marc and Raynaud, Olivier and Thierry, Eric}, biburl = {https://www.bibsonomy.org/bibtex/25fa4f34a6ebbc84978ff7737a35f46e1/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2000}, editor = {Reichel, Horst and Tison, Sophie}, ee = {https://doi.org/10.1007/3-540-46541-3_44}, interhash = {94722850c7cc79aeadde5293e8eac9ee}, intrahash = {5fa4f34a6ebbc84978ff7737a35f46e1}, isbn = {3-540-67141-2}, keywords = {dblp}, pages = {529-541}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T15:25:49.000+0200}, title = {Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2000.html#LanlignelRT00}, volume = 1770, year = 2000 }