{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:38:41Z","timestamp":1725878321917},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319519623"},{"type":"electronic","value":"9783319519630"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51963-0_17","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T06:17:39Z","timestamp":1484029059000},"page":"217-228","source":"Crossref","is-referenced-by-count":1,"title":["Enumerating Minimal Tropical Connected Sets"],"prefix":"10.1007","author":[{"given":"Dieter","family":"Kratsch","sequence":"first","affiliation":[]},{"given":"Mathieu","family":"Liedloff","sequence":"additional","affiliation":[]},{"given":"Mohamed Yosri","family":"Sayadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"issue":"3","key":"17_CR1","first-page":"327","volume":"17","author":"J-A Angles d\u2019Auriac","year":"2016","unstructured":"Angles d\u2019Auriac, J.-A., Cohen, N., El Maftouhi, A., Harutyunyan, A., Legay, S., Manoussakis, Y.: Connected tropical subgraphs in vertex-colored graphs. Discrete Math. Theor. Comput. Sci. 17(3), 327\u2013348 (2016). http:\/\/dmtcs.episciences.org\/2151","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. society for industrial and applied mathematics (SIAM), Philadelphia, PA, SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-319-13524-3_13","volume-title":"Parameterized and Exact Computation","author":"M Chapelle","year":"2014","unstructured":"Chapelle, M., Cochefert, M., Kratsch, D., Letourneur, R., Liedloff, M.: Exact exponential algorithms to find a tropical connected set of minimum size. In: Cygan, M., Heggernes, P. (eds.) IPEC 2014. LNCS, vol. 8894, pp. 147\u2013158. Springer, Heidelberg (2014)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Couturier, J., Heggernes, P., van\u2019t Hof, P., Kratsch, D.: Minimal dominating sets in graph classes, combinatorial bounds and enumeration. Theor. Comput. Sci. 487, 82\u201394 (2013)","DOI":"10.1016\/j.tcs.2013.03.026"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Couturier, J.-F., Heggernes, P., van\u2019t Hof, P., Villanger, Y.: Maximum number of minimal feedback vertex sets in chordal graphs and cographs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 133\u2013144. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-32241-9_12"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.tcs.2014.11.006","volume":"562","author":"J Couturier","year":"2015","unstructured":"Couturier, J., Letourneur, R., Liedloff, M.: On the number of minimal dominating sets on some graph classes. Theor. Comput. Sci. 562, 634\u2013642 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR7","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2012)"},{"issue":"2","key":"17_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s00453-007-9152-0","volume":"52","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: exact and enumeration algorithms. Algorithmica 52(2), 293\u2013307 (2008)","journal-title":"Algorithmica"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Gaspers, S., Lokshtanov, D., Saurabh, S.: Exact algorithms via monotone local search. In: Proceedings of STOC, pp. 764\u2013775 (2016)","DOI":"10.1145\/2897518.2897551"},{"issue":"1","key":"17_CR10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1435375.1435384","volume":"5","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure, conquer: bounding minimal dominating sets and applications. ACM Trans. Algorithms 5(1), 9 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"17_CR11","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s00224-007-2007-x","volume":"41","author":"FV Fomin","year":"2007","unstructured":"Fomin, F.V., Heggernes, P., Kratsch, D.: Exact algorithms for graph homomorphisms. Theor. Comp. Sys. 41(2), 381\u2013393 (2007)","journal-title":"Theor. Comp. Sys."},{"issue":"1","key":"17_CR12","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/s00453-012-9731-6","volume":"69","author":"FV Fomin","year":"2014","unstructured":"Fomin, F.V., Heggernes, P., Kratsch, D., Papadopoulos, C., Villanger, Y.: Enumerating minimal subset feedback vertex sets. Algorithmica 69(1), 216\u2013231 (2014)","journal-title":"Algorithmica"},{"key":"17_CR13","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2010)"},{"key":"17_CR14","unstructured":"Fomin, F.V., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: Proceedings STACS 2010, Dagstuhl, LIPIcs, vol. 43, pp. 383\u2013394 (2010)"},{"key":"17_CR15","unstructured":"Gaspers, S., Mackenzie, S.: On the number of minimal separators in graphs, CoRR abs\/1503.01203 (2015)"},{"issue":"1","key":"17_CR16","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1002\/jgt.21631","volume":"72","author":"S Gaspers","year":"2013","unstructured":"Gaspers, S., Mnich, M.: Feedback vertex sets in tournaments. J. Graph Theor. 72(1), 72\u201389 (2013)","journal-title":"J. Graph Theor."},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-319-29516-9_20","volume-title":"Combinatorial Algorithms","author":"PA Golovach","year":"2016","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D.: Enumeration and maximum number of minimal connected vertex covers in graphs. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 235\u2013247. Springer, Heidelberg (2016)"},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.jda.2013.09.005","volume":"26","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D., Saei, R.: Subset feedback vertex sets in chordal graphs. J. Discr. Algorithms 26, 7\u201315 (2014)","journal-title":"J. Discr. Algorithms"},{"key":"17_CR19","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57, 2nd edn. Elsevier Science B.V., Amsterdam (2004)","edition":"2"},{"key":"17_CR20","doi-asserted-by":"crossref","first-page":"342","DOI":"10.4153\/CJM-1965-034-0","volume":"17","author":"DC Kay","year":"1965","unstructured":"Kay, D.C., Chartrand, G.: A characterization of certain Ptolemaic graphs. Can. J. Math. 17, 342\u2013346 (1965)","journal-title":"Can. J. Math."},{"issue":"4","key":"17_CR21","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TCBB.2006.55","volume":"3","author":"V Lacroix","year":"2006","unstructured":"Lacroix, V., Fernandes, C.G., Sagot, M.-F.: Motif search in graphs: application to metabolic networks. IEEE\/ACM Trans. Comput. Biol. Bioinform. 3(4), 360\u2013368 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"17_CR22","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0895480192229273","volume":"7","author":"F McMorris","year":"1994","unstructured":"McMorris, F., Warnow, T., Wimer, T.: Triangulating vertex-colored graphs. SIAM J. Discr. Math. 7, 296\u2013306 (1994)","journal-title":"SIAM J. Discr. Math."},{"key":"17_CR23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math. 3, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"17_CR24","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1089\/cmb.2006.13.133","volume":"13","author":"J Scott","year":"2006","unstructured":"Scott, J., Ideker, T., Karp, R.M., Sharan, R.: Efficient algorithms for detecting signaling pathways in protein interaction networks. J. Comput. Biol. 13, 133\u2013144 (2006)","journal-title":"J. Comput. Biol."},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/978-3-642-45043-3_36","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"JA Telle","year":"2013","unstructured":"Telle, J.A., Villanger, Y.: Connecting terminals and 2-disjoint connected subgraphs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 418\u2013428. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T07:46:24Z","timestamp":1498376784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}