{"department":[{"_id":"63"}],"title":"Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient","_id":"17432","citation":{"chicago":"Baswana, Surender, Shiv Gupta, and Ayush Tulsyan. “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.” In <i>44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)</i>, 65:1--65:16. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.65\">https://doi.org/10.4230/LIPICS.MFCS.2019.65</a>.","short":"S. Baswana, S. Gupta, A. Tulsyan, in: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, pp. 65:1--65:16.","bibtex":"@inproceedings{Baswana_Gupta_Tulsyan_2019, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.65\">10.4230/LIPICS.MFCS.2019.65</a>}, booktitle={44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Baswana, Surender and Gupta, Shiv and Tulsyan, Ayush}, year={2019}, pages={65:1--65:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","apa":"Baswana, S., Gupta, S., &#38; Tulsyan, A. (2019). Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. In <i>44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)</i> (pp. 65:1--65:16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.65\">https://doi.org/10.4230/LIPICS.MFCS.2019.65</a>","ama":"Baswana S, Gupta S, Tulsyan A. Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. In: <i>44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)</i>. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2019:65:1--65:16. doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.65\">10.4230/LIPICS.MFCS.2019.65</a>","mla":"Baswana, Surender, et al. “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.” <i>44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)</i>, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, pp. 65:1--65:16, doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.65\">10.4230/LIPICS.MFCS.2019.65</a>.","ieee":"S. Baswana, S. Gupta, and A. Tulsyan, “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient,” in <i>44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)</i>, 2019, pp. 65:1--65:16."},"user_id":"15415","date_created":"2020-07-29T07:33:56Z","status":"public","year":"2019","author":[{"last_name":"Baswana","full_name":"Baswana, Surender","first_name":"Surender"},{"last_name":"Gupta","full_name":"Gupta, Shiv","first_name":"Shiv"},{"first_name":"Ayush","full_name":"Tulsyan, Ayush","last_name":"Tulsyan"}],"publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi":"10.4230/LIPICS.MFCS.2019.65","page":"65:1--65:16","publication":"44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)","type":"conference","date_updated":"2022-01-06T06:53:12Z","language":[{"iso":"eng"}]}