Go to the corresponding LIPIcs Volume Portal 
Eiben, Eduard ; Majumdar, Diptapriyo ; Ramanujan, M. S.
pdfformat: 

@InProceedings{eiben_et_al:LIPIcs.MFCS.2023.45, author = {Eiben, Eduard and Majumdar, Diptapriyo and Ramanujan, M. S.}, title = {{Finding a Highly Connected Steiner Subgraph and its Applications}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {45:145:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772921}, ISSN = {18688969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18579}, URN = {urn:nbn:de:0030drops185793}, doi = {10.4230/LIPIcs.MFCS.2023.45}, annote = {Keywords: Parameterized Complexity, Steiner Subgraph Extension, pedgeconnected graphs, Matroids, Representative Families} }
Keywords:  Parameterized Complexity, Steiner Subgraph Extension, pedgeconnected graphs, Matroids, Representative Families  
Collection:  48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)  
Issue Date:  2023  
Date of publication:  21.08.2023 