[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_26bec47f-33d8-4eb0-8098-da5c1dc20d61":3,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:26bec47f-33d8-4eb0-8098-da5c1dc20d61,\"}":105},{"code":4,"data":5,"meta":22},"SUCCESS",{"id":6,"createTime":7,"updateTime":8,"relativeEntities":9,"slug":10,"properties":11,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":24,"manageAffiliations":41,"indexDatabases":64,"url":22,"thumbnailPath":22,"statistic":22,"gsStatistic":22,"type":22,"analyzePriority":22},"26bec47f-33d8-4eb0-8098-da5c1dc20d61","2023-12-05T05:30:53.221+00:00","2025-11-21T09:58:00.229+00:00",[],"Theory-of-Computing-Systems",{"issn":12,"eissn":14,"title":16,"url":18},{"VOID":13},"14330490",{"VOID":15},"14324350",{"EN":17},"Theory of Computing Systems",{"VOID":19},"https:\u002F\u002Flink.springer.com\u002Fjournal\u002F224","PUBLISHER","PENDING",null,0,[25,33],{"id":26,"createTime":27,"updateTime":28,"relativeEntities":29,"label":30,"description":32,"parentId":22,"standard":22,"scholarHubFieldId":22},"cfe20487-5108-4c23-a284-2aedca5fb76d","2023-05-29T10:24:09.965+00:00","2023-11-21T05:15:17.277+00:00",[],{"EN":31},"Theoretical Computer Science",{},{"id":34,"createTime":35,"updateTime":36,"relativeEntities":37,"label":38,"description":40,"parentId":22,"standard":22,"scholarHubFieldId":22},"e8c4e2fa-b139-4154-a158-595bd93d381c","2023-05-29T10:24:07.692+00:00","2023-11-21T07:15:31.396+00:00",[],{"EN":39},"Computational Theory and Mathematics",{},[42,55],{"id":43,"createTime":44,"updateTime":45,"relativeEntities":46,"slug":47,"properties":48,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":52,"url":22,"parentIds":53,"statistic":22},"1553eaa4-de45-4fd0-9ca3-a7b44788e9e7","2023-05-29T10:24:31.377+00:00","2025-11-21T10:04:21.002+00:00",[],"Springer-New-York",{"title":49},{"EN":50},"Springer New York","AFFILIATION",8,[54],"9a7c7208-b28a-42c2-a634-5a7f90eee3ab",{"id":56,"createTime":57,"updateTime":58,"relativeEntities":59,"slug":60,"properties":61,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"url":22,"parentIds":63,"statistic":22},"26a19206-5cad-4456-bb2f-49abd254fbc6","2024-04-19T01:59:34.612+00:00","2025-11-21T10:06:47.646+00:00",[],"SPRINGER",{"title":62},{"EN":60},[],[65,85],{"id":66,"indexDatabase":67,"url":79,"indexYears":80,"academicFieldIds":81,"indexDatabaseRanking":84},"8c28d1ba-8327-4367-b6ee-445faaf38ad1",{"id":68,"createTime":69,"updateTime":70,"relativeEntities":71,"label":72,"description":74,"key":76,"publicationTags":77,"standard":22},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":73,"VI":73},"Scopus - Elsevier",{"EN":73,"VI":75},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[78],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F20573","1996-2025",[82,83],"bccef185-f7d5-4f2e-881a-2dc383ea6c57","8f050cfc-6be8-4218-91ba-e890405f0438","SCOPUS__Q2",{"id":86,"indexDatabase":87,"url":101,"indexYears":22,"academicFieldIds":102,"indexDatabaseRanking":22},"643cd06e-8b07-41c5-8a9c-5382336bf292",{"id":88,"createTime":89,"updateTime":90,"relativeEntities":91,"label":92,"description":94,"key":97,"publicationTags":98,"standard":22},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":93,"VI":93},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":95,"EN":96},"Cơ sở dữ liệu SCIE","SCIE database","scie",[99,100],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=1432-4350",[103,104],"874c55e0-262a-4246-b3d1-85e02c3c09db","a410dee4-fcd0-43bf-ac42-c2f733ee737f",{"meta":106,"data":108},{"total":107},"1577",[109,222,301,363,437,508,603,665,729,877],{"id":110,"createTime":111,"updateTime":112,"relativeEntities":113,"slug":114,"properties":115,"entityType":124,"verifyStatus":125,"verifyTime":112,"verifyNote":126,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"primaryUrl":127,"fullTextUrl":22,"authors":128,"publicationType":190,"publisherRelationship":191,"citationCount":22,"citationInfo":22,"publishDate":219,"publishYear":220,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":22,"openAccess":22,"references":22,"isForceReanalyzing":221},"57a78449-e71e-4e96-b548-8b40ef07c459","2024-01-20T02:15:36.139+00:00","2025-02-26T23:58:44.897+00:00",[],"On-the-Partial-Vertex-Cover-Problem-in-Bipartite-Graphs-a-Parameterized-Perspective",{"references":116,"abstract":118,"title":120,"doi":122},{"VOID":117},"Amini, O., Fomin, F.V., Saurabh, S.: Implicit branching and parameterized partial cover problems. J. Comp. Sys. Sciences (77), 1159–1171 (2011)\nAgeev A.A., Sviridenko M.: Approximation algorithms for maximum coverage and max cut with given size of parts. IPCO, pp. 17–30 (1999)\nAlimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1–2), 123–134 (2000)\nApollonio, N., Simeone, B.: The maximum vertex coverage problem on bipartite graphs. Discrete Appl. Math. (165), 37–48 (2014)\nApollonio, N., Simeone, B.: Improved approximation of maximum vertex coverage problem on bipartite graphs. SIAM J. Discrete Math. 28(3), 1137–1151 (2014)\nBar-Yehuda, R.: Using homogeneous weights for approximating the partial cover problem. J. Algorithms 39(2), 137–144 (2001)\nBilgin, C.C., Caskurlu, B., Gehani, A., Subramani, K.: Analytical models for risk-based intrusion response. Computer Networks (Special issue on Security\u002FIdentity Architecture) 57(10), 2181–2192 (2013)\nBläser, M.: Computing small partial coverings. Inf. Process. Lett. 85(6), 327–331 (2003)\nBshouty N.H., Burroughs L.: Massaging a linear programming solution to give a \\(2\\)-approximation for a generalization of the vertex cover problem. In: Proceedings of STACS, pp. 298–308 (1998)\nCaskurlu, B., Mkrtchyan, V., Parekh, O., Subramani, K.: Partial vertex cover and budgeted maximum coverage in bipartite graphs. SIAM J. Disc. Math. 31(3), 2172–2184 (2017)\nCaskurlu B., Mkrtchyan V., Parekh O., Subramani K.: On partial vertex cover and budgeted maximum coverage problems in bipartite graphs. IFIP TCS, pp. 13–26 (2014)\nChen, J., Kanj, I.A.: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. J. Comput. Syst. Sci. 67(4), 833–847 (2003)\nCygan M., Fomin F.V., Kowalik L., Lokshtanov D., Marx D., Pilipczuk M., Pilipczuk M., Saurabh S.: Parameterized algorithms. Springer, pp. 3–555 (2015)\nDinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. of Math. 162(1), 439–485 (2005)\nDowney, R., Fellows, M., Regan, K.: Parameterized circuit complexity and the W hierarchy. Theoret. Comput. Sci. 191, 97–115 (1998)\nDowney, R., Fellows, M.: Fixed-parameter tractability and completeness I: basic results. SIAM J. Comput. 24(4), 873–921 (1995)\nHassin, R., Levin, A.: The minimum generalized vertex cover problem. ACM Trans. Algorithms 2(1), 66–78 (2006)\nHochbaum D.S.: The \\(t\\)-vertex cover problem: extending the half integrality framework with budget constraints. In: Proceedings of APPROX, pp. 111–122 (1998)\nJoret, G., Vetta, A.: Reducing the rank of a matroid. Disc. Math. and Theor. Comp. Sci. 17(2), 143–156 (2015)\nKarakostas, G.: A better approximation ratio for the vertex cover problem. ACM Transactions on Algorithms 5(4), 41:1-41:8 (2009)\nKarp R.: Reducibility among combinatorial problems. In: Miller R., Thatcher J. (eds.), Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)\nKhot, S., Regev, O.: Vertex cover might be hard to approximate to within \\(2-\\epsilon \\). J. Comput. Syst. Sci. (74), 335–349 (2008)\nKhot S., Minzer D., Safra M.: Pseudorandom sets in grassmann graph have near-perfect expansion. Electronic colloquium on computational complexity, Report No. 6 (2018)\nKhuller, S., Gandhi, R., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55–84 (2004)\nLanger A., Kneis J., Rossmanith P.: Improved upper bounds for partial vertex cover. In: WG, pp. 240–251 (2008)\nMestre, J.: A primal-dual approximation algorithm for partial vertex cover: making educated guesses. Algorithmica 55(1), 227–239 (2009)\nMestre, J., Bar-Yehuda, R., Flysher, G., Rawitz, D.: Approximation of partial capacitated vertex cover. Lect. Notes Comput. Sci. (4698), 335–346 (2007)\nMkrtchyan V., Parekh O., Segev D., Subramani K.: The approximability of partial vertex covers in trees. In: SOFSEM, Limerick, Ireland, pp. 350–360 (2017)\nMkrtchyan V., Petrosyan G., Subramani K., Wojciechowski P.: Parameterized algorithms for partial vertex covers in bipartite graphs. In: IWOCA, pp. 395–408 (2020)\nMkrtchyan, V., Petrosyan, G.: On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs. J. Graph Algorithms Appl. 26(1), 91–110 (2022)\nMölle D., Kneis J., Rossmanith P.: Partial vs. complete domination: \\(t\\)-dominating set. In: SOFSEM (1), pp. 367–376 (2007)\nMoss A., Khuller S., (Seffi) Naor J.: The budgeted maximum coverage problem. Inform. Process. Lett. 70(1), 39–45 (1999)\nNiedermeier, R., Guo, J., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. Lect. Notes Comput. Sci. (3608), 36–48 (2005)\nOrponen P., Mannila H.: On approximation preserving reductions: complete problems and robust measures. Technical report, Department of Computer Science, University of Helsinki (1987)\nPapadimitriou, Ch.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. System Sci. 43(3), 425–440 (1991)\nParekh, O., Könemann, J., Segev, D.: A unified approach to approximating partial covering problems. Algorithmica 59(4), 489–509 (2011)\nRichter S., Kneis J., Mölle D., Rossmanith P.: Intuitive algorithms and \\(t\\)-vertex cover. In: ISAAC, pp. 598–607 (2006)\nStege U., van Rooij I., Hertel A., Hertel P.: An \\(O(pn + 1.151^p)\\)-algorithm for p-profit cover and its practical implications for vertex cover. In: ISAAC, pp. 249–261 (2002)\nPaschos V.Th.: A polynomial time approximation schema for max \\(k-\\)vertex cover in bipartite graphs. arXiv:1909.08435v1 (2019)\nVazirani, V.V.: Approximation algorithms. Springer-Verlag, New York Inc., New York, NY, USA (2001)",{"EN":119},"In this paper, we examine variants of the partial vertex cover problem from the perspective of parameterized algorithms. Recall that in the classical vertex cover problem (VC), we are given a graph \n              \n                \n              \n              $$\\mathbf{G = \\langle V, E \\rangle }$$\n              \n             and a number k and asked if we can cover all of the edges in \n              \n                \n              \n              $$\\textbf{E}$$\n              \n            , using at most k vertices from \n              \n                \n              \n              $$\\textbf{V}$$\n              \n            . The partial vertex cover problem (PVC) is a more general version of the VC problem in which we are given an additional parameter \n              \n                \n              \n              $$k'$$\n              \n            . We then ask the question of whether at least \n              \n                \n              \n              $$k'$$\n              \n             of the edges in \n              \n                \n              \n              $$\\textbf{E}$$\n              \n             can be covered using at most k vertices from \n              \n                \n              \n              $$\\textbf{V}$$\n              \n            . Note that the VC problem is a special case of the PVC problem when \n              \n                \n              \n              $$k'=|\\textbf{E}|$$\n              \n            . In this paper, we study the weighted generalizations of the PVC problem. This is called the weighted partial vertex cover problem (WPVC). In the WPVC problem, we are given two parameters R and L, associated respectively with the vertex set \n              \n                \n              \n              $$\\textbf{V}$$\n              \n             and edge set \n              \n                \n              \n              $$\\textbf{E}$$\n              \n             of the graph \n              \n                \n              \n              $$\\textbf{G}$$\n              \n             respectively. Additionally, we are given non-negative integral weight functions for the vertices and the edges. The goal then is to cover edges of total weight at least L, using vertices of total weight at most R. This paper studies several variants of the PVC and WPVC problems and establishes new results from the perspective of fixed-parameter tractability and W[1]-hardness. We also introduce a new problem called the partial vertex cover with matching constraints and show that it is Fixed-Parameter Tractable (FPT) for a certain class of graphs. Finally, we show that the WPVC problem is APX-complete for bipartite graphs.",{"EN":121},"On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective",{"VOID":123},"10.1007\u002Fs00224-023-10152-w","PUBLICATION","VERIFIED","Auto Verify","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs00224-023-10152-w",[129,146,159,174],{"id":130,"sortIndex":131,"researcher":22,"roles":132,"affiliations":134,"properties":143},"d649bcf4-ad11-4f79-86fd-2fe46da51fc9",2,[133],"AUTHOR",[135],{"id":22,"sortIndex":23,"affiliation":136,"properties":22},{"id":137,"createTime":138,"updateTime":138,"relativeEntities":139,"slug":22,"properties":140,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"78104ef5-3f11-4123-88f7-087c011455e4","2024-01-11T23:34:57.125+00:00",[],{"title":141},{"VI":142},"LDCSEE, West Virginia University, Morgantown, USA",{"title":144},{"VI":145},"K. Subramani",{"id":147,"sortIndex":148,"researcher":22,"roles":149,"affiliations":150,"properties":156},"687be9a0-8f09-42fe-8ac8-e40748ac98f2",3,[133],[151],{"id":22,"sortIndex":23,"affiliation":152,"properties":22},{"id":137,"createTime":138,"updateTime":138,"relativeEntities":153,"slug":22,"properties":154,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},[],{"title":155},{"VI":142},{"title":157},{"VI":158},"Piotr Wojciechowski",{"id":160,"sortIndex":23,"researcher":22,"roles":161,"affiliations":162,"properties":171},"41e8738f-d22f-4227-8ac2-dde11af0d21c",[133],[163],{"id":22,"sortIndex":23,"affiliation":164,"properties":22},{"id":165,"createTime":166,"updateTime":166,"relativeEntities":167,"slug":22,"properties":168,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"e330c32b-52eb-4e9b-bece-c758d9083799","2024-01-20T02:15:36.158+00:00",[],{"title":169},{"VI":170},"Gran Sasso Science Institute, School of Advanced Studies, L’Aquila, Italy",{"title":172},{"VI":173},"Vahan Mkrtchyan",{"id":175,"sortIndex":176,"researcher":22,"roles":177,"affiliations":178,"properties":187},"60e8b24d-c185-411a-acee-27cb7bba6086",1,[133],[179],{"id":22,"sortIndex":23,"affiliation":180,"properties":22},{"id":181,"createTime":182,"updateTime":182,"relativeEntities":183,"slug":22,"properties":184,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"5ab5cf73-32fd-4a0a-bdb6-789e2820e2bf","2024-01-20T02:15:36.171+00:00",[],{"title":185},{"VI":186},"Department of Informatics and Applied Mathematics, Yerevan State University, Yerevan, Armenia",{"title":188},{"VI":189},"Garik Petrosyan","ARTICLE",{"url":127,"publisher":192,"properties":216},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":193,"slug":10,"properties":194,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":199,"manageAffiliations":200,"indexDatabases":201,"url":22,"thumbnailPath":22,"statistic":22,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":195,"eissn":196,"title":197,"url":198},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},[],[],[202,209],{"id":86,"indexDatabase":203,"url":101,"indexYears":22,"academicFieldIds":208,"indexDatabaseRanking":22},{"id":88,"createTime":89,"updateTime":90,"relativeEntities":204,"label":205,"description":206,"key":97,"publicationTags":207,"standard":22},[],{"EN":93,"VI":93},{"VI":95,"EN":96},[99,100],[103,104],{"id":66,"indexDatabase":210,"url":79,"indexYears":80,"academicFieldIds":215,"indexDatabaseRanking":84},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":211,"label":212,"description":213,"key":76,"publicationTags":214,"standard":22},[],{"EN":73,"VI":73},{"EN":73,"VI":75},[78],[82,83],{"pages":217},{"VOID":218},"1-22","2023-12-01",2023,false,{"id":223,"createTime":224,"updateTime":225,"relativeEntities":226,"slug":227,"properties":228,"entityType":124,"verifyStatus":125,"verifyTime":225,"verifyNote":126,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"primaryUrl":237,"fullTextUrl":22,"authors":238,"publicationType":190,"publisherRelationship":269,"citationCount":22,"citationInfo":22,"publishDate":299,"publishYear":300,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":22,"openAccess":22,"references":22,"isForceReanalyzing":221},"6137ed28-c389-42e7-a804-1b82632ca9cc","2024-01-16T10:44:37.193+00:00","2025-02-04T23:58:35.327+00:00",[],"A-local-implicit-function-theorem-and-application-to-systems-of-differential-equations",{"references":229,"abstract":231,"title":233,"doi":235},{"VOID":230},"J. T. Schwartz,Nonlinear Functional Analysis, Gordon and Breach Science Publ., 1969, 77.\nI. W. Sandberg, Global implicit function theorems,IEEE Trans. Circ. and Syst., Vol. CAS-28, 145–149 (1981).\nM. Spivak,Differential Geometry, Vol. I, Publish or Perish, Inc. 1979, p. 56.\nJ. Dieudonné,Foundations of Modern Analysis, Academic Press, 1960, p. 268\nJ. K. Hale,Ordinary Differential Equations, Wiley-Interscience, 1969, p. 14.\nS. L. Campbell and C. D. Meyer, Jr.,Generalized Inverses of Linear Transformations, Pitman Publ. Co., 1979.\nR. W. Newcomb, The semistate description of nonlinear time-variable circuits,IEEE Trans. CAS, Vol. CAS-28 62–71 (1981).",{"EN":232},"A local implicit function theorem is proved which assumes certain injectivity rather than differentiability. Moreover, there is given a result on solvability of noncanonic systems of differential equations which arise in optimal control and network theory.",{"EN":234},"A local implicit function theorem and application to systems of differential equations",{"VOID":236},"10.1007\u002FBF01699472","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002FBF01699472",[239,254],{"id":240,"sortIndex":176,"researcher":22,"roles":241,"affiliations":242,"properties":251},"d5f72a08-8350-4a0e-bfd2-1da86ce4caaf",[133],[243],{"id":22,"sortIndex":23,"affiliation":244,"properties":22},{"id":245,"createTime":246,"updateTime":246,"relativeEntities":247,"slug":22,"properties":248,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"1d5f8749-0f08-44b5-85ed-f09a7b2c9211","2024-01-16T10:44:37.217+00:00",[],{"title":249},{"VI":250},"TATA Institute of Fundamental Research, Indian Institute of Science, Bangalore, India",{"title":252},{"VI":253},"Shiva Shankar",{"id":255,"sortIndex":23,"researcher":22,"roles":256,"affiliations":257,"properties":266},"d876ff6f-c2d5-4680-a990-a28670ee244a",[133],[258],{"id":22,"sortIndex":23,"affiliation":259,"properties":22},{"id":260,"createTime":261,"updateTime":261,"relativeEntities":262,"slug":22,"properties":263,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"8aadc0d6-7ae9-4059-a071-ba652e74a896","2024-01-15T21:36:02.109+00:00",[],{"title":264},{"VI":265},"Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, Stony Brook, USA",{"title":267},{"VI":268},"Vaclav Dolezal",{"url":237,"publisher":270,"properties":294},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":271,"slug":10,"properties":272,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":277,"manageAffiliations":278,"indexDatabases":279,"url":22,"thumbnailPath":22,"statistic":22,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":273,"eissn":274,"title":275,"url":276},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},[],[],[280,287],{"id":86,"indexDatabase":281,"url":101,"indexYears":22,"academicFieldIds":286,"indexDatabaseRanking":22},{"id":88,"createTime":89,"updateTime":90,"relativeEntities":282,"label":283,"description":284,"key":97,"publicationTags":285,"standard":22},[],{"EN":93,"VI":93},{"VI":95,"EN":96},[99,100],[103,104],{"id":66,"indexDatabase":288,"url":79,"indexYears":80,"academicFieldIds":293,"indexDatabaseRanking":84},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":289,"label":290,"description":291,"key":76,"publicationTags":292,"standard":22},[],{"EN":73,"VI":73},{"EN":73,"VI":75},[78],[82,83],{"volume":295,"pages":297},{"VOID":296},"18",{"VOID":298},"251-256","1985-12-01",1985,{"id":302,"createTime":303,"updateTime":304,"relativeEntities":305,"slug":306,"properties":307,"entityType":124,"verifyStatus":125,"verifyTime":304,"verifyNote":126,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"primaryUrl":314,"fullTextUrl":22,"authors":315,"publicationType":190,"publisherRelationship":331,"citationCount":22,"citationInfo":22,"publishDate":361,"publishYear":362,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":22,"openAccess":22,"references":22,"isForceReanalyzing":221},"744abbe9-56a9-4fc7-ad72-77feeb66a95f","2023-12-19T07:46:28.858+00:00","2025-02-13T23:57:48.733+00:00",[],"Some-Bounds-on-the-Computational-Power-of-Piecewise-Constant-Derivative-Systems",{"abstract":308,"title":310,"doi":312},{"EN":309}," We study the computational power of Piecewise Constant Derivative (PCD) systems. PCD systems are dynamical systems defined by a piecewise constant differential equation and can be considered as computational machines working on a continuous space with a continuous time. We show that the computation time of these machines can be measured either as a discrete value, called discrete time, or as a continuous value, called continuous time. We relate the two notions of time for general PCD systems. We prove that general PCD systems are equivalent to Turing machines and linear machines in finite discrete time. We prove that the languages recognized by purely rational PCD systems in dimension d  in finite continuous time are precisely the languages of the (d-2) th level of the arithmetical hierarchy. Hence the reachability problem of purely rational PCD systems of dimension d  in finite continuous time is Σ\n\n                        \n                  d-2\n                 -complete.",{"EN":311},"Some Bounds on the Computational Power of Piecewise Constant Derivative Systems",{"VOID":313},"10.1007\u002Fs002240000111","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs002240000111",[316],{"id":317,"sortIndex":23,"researcher":22,"roles":318,"affiliations":319,"properties":328},"9ecc343b-6151-49ee-8f7a-839a002dafe5",[133],[320],{"id":22,"sortIndex":23,"affiliation":321,"properties":22},{"id":322,"createTime":323,"updateTime":323,"relativeEntities":324,"slug":22,"properties":325,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"8080bc6a-b0fb-4646-aac9-2da1138057c9","2023-12-19T07:46:28.879+00:00",[],{"title":326},{"VI":327},"LIP, ENS-Lyon,   46 Allée d'Italie, 69364 Lyon Cedex 07, France   Olivier.Bournez@ens-lyon.fr, , FR",{"title":329},{"VI":330},"O. Bournez",{"url":314,"publisher":332,"properties":356},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":333,"slug":10,"properties":334,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":339,"manageAffiliations":340,"indexDatabases":341,"url":22,"thumbnailPath":22,"statistic":22,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":335,"eissn":336,"title":337,"url":338},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},[],[],[342,349],{"id":86,"indexDatabase":343,"url":101,"indexYears":22,"academicFieldIds":348,"indexDatabaseRanking":22},{"id":88,"createTime":89,"updateTime":90,"relativeEntities":344,"label":345,"description":346,"key":97,"publicationTags":347,"standard":22},[],{"EN":93,"VI":93},{"VI":95,"EN":96},[99,100],[103,104],{"id":66,"indexDatabase":350,"url":79,"indexYears":80,"academicFieldIds":355,"indexDatabaseRanking":84},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":351,"label":352,"description":353,"key":76,"publicationTags":354,"standard":22},[],{"EN":73,"VI":73},{"EN":73,"VI":75},[78],[82,83],{"volume":357,"pages":359},{"VOID":358},"32",{"VOID":360},"35-67","1999-02-01",1999,{"id":364,"createTime":365,"updateTime":366,"relativeEntities":367,"slug":368,"properties":369,"entityType":124,"verifyStatus":125,"verifyTime":366,"verifyNote":126,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"primaryUrl":376,"fullTextUrl":22,"authors":377,"publicationType":190,"publisherRelationship":405,"citationCount":22,"citationInfo":22,"publishDate":435,"publishYear":436,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":22,"openAccess":22,"references":22,"isForceReanalyzing":221},"95eae572-ca0d-4f1b-93bf-295eb8de7a47","2024-01-25T21:03:48.460+00:00","2025-01-01T23:57:30.845+00:00",[],"The-Non-Enumerability-of-the-Determinant-and-the-Rank",{"abstract":370,"title":372,"doi":374},{"EN":371}," We investigate the complexity of enumerative approximation of two fundamental problems in linear algebra, computing the rank and the determinant of a matrix. We show that both are as hard to approximate (in the enumerative sense) as to compute exactly. In particular, if there exists an enumerator that, given a matrix over some finite field, outputs a list of constantly many numbers, one of which is guaranteed to be the rank of the matrix, then it can be determined in AC\n                  0\n                  (with oracle access to the enumerator) which of these numbers is the rank. Thus, for example, if the enumerator is an FL function, then the problem of computing the rank is in FL. For the determinant function we establish the following two results: (1) If the determinant is poly-enumerable in logspace, then it can be computed exactly in FL. (2) For any prime p , if computing the determinant modulo p  is (p-1) -enumerable in FL (i.e., if one could eliminate a single possible value for the determinant modulo p ), then the determinant modulo p  can be computed in FL. Because there is a close connection between these two functions and logspace counting classes, we hope that our results can give a better understanding of the power of counting in logspace, and the relationships among the complexity classes sandwiched between NL and uniform TC\n                  1\n                 .\n",{"EN":373},"The (Non)Enumerability of the Determinant and the Rank",{"VOID":375},"10.1007\u002Fs00224-003-1091-9","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs00224-003-1091-9",[378,393],{"id":379,"sortIndex":176,"researcher":22,"roles":380,"affiliations":381,"properties":390},"a2c57fea-d79f-4280-ae5a-4f416d890fd2",[133],[382],{"id":22,"sortIndex":23,"affiliation":383,"properties":22},{"id":384,"createTime":385,"updateTime":385,"relativeEntities":386,"slug":22,"properties":387,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"11c867b8-7305-4448-bd03-13964bcd64a1","2024-01-25T21:03:48.484+00:00",[],{"title":388},{"VI":389},"Department of Computer Science, University of Rochester, beygel@cs.rochester.edu, ogihara@cs.rochester.edu, US",{"title":391},{"VI":392},"Mitsunori Ogihara",{"id":394,"sortIndex":23,"researcher":22,"roles":395,"affiliations":396,"properties":402},"efc66978-bcc4-4f87-8571-ecd5a9975b1b",[133],[397],{"id":22,"sortIndex":23,"affiliation":398,"properties":22},{"id":384,"createTime":385,"updateTime":385,"relativeEntities":399,"slug":22,"properties":400,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},[],{"title":401},{"VI":389},{"title":403},{"VI":404},"Alina Beygelzimer",{"url":376,"publisher":406,"properties":430},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":407,"slug":10,"properties":408,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":413,"manageAffiliations":414,"indexDatabases":415,"url":22,"thumbnailPath":22,"statistic":22,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":409,"eissn":410,"title":411,"url":412},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},[],[],[416,423],{"id":86,"indexDatabase":417,"url":101,"indexYears":22,"academicFieldIds":422,"indexDatabaseRanking":22},{"id":88,"createTime":89,"updateTime":90,"relativeEntities":418,"label":419,"description":420,"key":97,"publicationTags":421,"standard":22},[],{"EN":93,"VI":93},{"VI":95,"EN":96},[99,100],[103,104],{"id":66,"indexDatabase":424,"url":79,"indexYears":80,"academicFieldIds":429,"indexDatabaseRanking":84},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":425,"label":426,"description":427,"key":76,"publicationTags":428,"standard":22},[],{"EN":73,"VI":73},{"EN":73,"VI":75},[78],[82,83],{"volume":431,"pages":433},{"VOID":432},"36",{"VOID":434},"359-374","2003-06-06",2003,{"id":438,"createTime":439,"updateTime":440,"relativeEntities":441,"slug":442,"properties":443,"entityType":124,"verifyStatus":125,"verifyTime":456,"verifyNote":126,"syncStatus":21,"languages":22,"translateLanguages":457,"viewCount":23,"primaryUrl":459,"fullTextUrl":22,"authors":460,"publicationType":190,"publisherRelationship":476,"citationCount":22,"citationInfo":22,"publishDate":506,"publishYear":507,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":22,"openAccess":22,"references":22,"isForceReanalyzing":221},"374b27e8-c955-4808-a0b6-c3fcadae08dd","2024-02-05T23:26:52.540+00:00","2025-02-04T23:57:09.538+00:00",[],"Categorical-and-topological-aspects-of-formal-languages",{"references":444,"abstract":446,"title":449,"doi":452,"keywords":454},{"VOID":445},"D. B. Benson, The basic algebraic structure in categories of derivations.Inf. and Control 28, 1–29 (1975).\nG. Birkhoff,Lattice Theory. AMS, Providence R.I. 1968.\nT. V. Griffiths, Some remarks on derivations in general rewriting systems.Inf. and Control 12, 27–54 (1968).\nG. Hotz, Eindeutigkeit und Mehrdeutigkeit formaler Sprachen.E.I.K. 2, 235–246 (1966).\nS. MacLane,Categories for the Working Mathematician. Springer, 1971.\nH. Walter, Topologies on Formal Languages.Math. Systems Theory 9, 142–158 (1975).",{"VI":447,"EN":448},"Bài báo này đặt công trình của H. Walter về phân loại ngữ pháp và ngôn ngữ thông qua hình thái học vào một khung tổng quát hơn và cung cấp các chứng minh ngắn gọn cho các kết quả chính của ông. Ngoài ra, bài báo cũng chứng minh rằng mọi ngữ pháp đều tương đương về mặt hình thái học với một ngữ pháp ở dạng chuẩn, rằng hình thái rời rạc có thể được hiện thực hóa trên mọi ngôn ngữ không ngữ cảnh, và rằng một ngôn ngữ là hữu hạn nếu và chỉ nếu mọi hình thái học trên nó đều có thể được hiện thực hóa như một trong các hình thái mà Walter đã đề xuất. Thêm vào đó, một phương pháp mới và rõ ràng được cung cấp để đem lại các kết quả cơ bản cần thiết, về sự chia hết và hủy bỏ trong các loại hình của các phép biến đổi, như đã được D. Benson và G. Hotz nghiên cứu.","This paper places the work of H. Walter on classification of grammars and languages via topology in a more general framework and provides short proofs of his main results. Also, it is proved that every grammar is topologically equivalent to one in normal form, that the discrete topology can be realized on every context-free language, and that a language is finite if and only if every topology on it can be realized as one of the topologies proposed by Walter. In addition, a new and straightforward approach is provided to yield the necessary background results, on divisibility and cancellation in categories of derivations, due to D. Benson and G. Hotz.",{"VI":450,"EN":451},"Các khía cạnh phân loại và hình thái học của ngôn ngữ hình thức","Categorical and topological aspects of formal languages",{"VOID":453},"10.1007\u002FBF01744299",{"VI":455},"ngữ pháp, ngôn ngữ không ngữ cảnh, hình thái học, phân loại ngôn ngữ, thuật toán, tính hữu hạn","2025-01-23T14:27:48.250+00:00",[458],"VI","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002FBF01744299",[461],{"id":462,"sortIndex":23,"researcher":22,"roles":463,"affiliations":464,"properties":473},"440f17c5-e10b-4044-95d7-e8232e023d28",[133],[465],{"id":22,"sortIndex":23,"affiliation":466,"properties":22},{"id":467,"createTime":468,"updateTime":468,"relativeEntities":469,"slug":22,"properties":470,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"63424e31-0a77-4066-80c6-10d95032d53f","2024-01-04T10:40:46.535+00:00",[],{"title":471},{"VI":472},"Department of Mathematics, McMaster University, Hamilton, Canada",{"title":474},{"VI":475},"Evelyn Nelson",{"url":459,"publisher":477,"properties":501},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":478,"slug":10,"properties":479,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":484,"manageAffiliations":485,"indexDatabases":486,"url":22,"thumbnailPath":22,"statistic":22,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":480,"eissn":481,"title":482,"url":483},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},[],[],[487,494],{"id":86,"indexDatabase":488,"url":101,"indexYears":22,"academicFieldIds":493,"indexDatabaseRanking":22},{"id":88,"createTime":89,"updateTime":90,"relativeEntities":489,"label":490,"description":491,"key":97,"publicationTags":492,"standard":22},[],{"EN":93,"VI":93},{"VI":95,"EN":96},[99,100],[103,104],{"id":66,"indexDatabase":495,"url":79,"indexYears":80,"academicFieldIds":500,"indexDatabaseRanking":84},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":496,"label":497,"description":498,"key":76,"publicationTags":499,"standard":22},[],{"EN":73,"VI":73},{"EN":73,"VI":75},[78],[82,83],{"volume":502,"pages":504},{"VOID":503},"13",{"VOID":505},"255-273","1979-12-01",1979,{"id":509,"createTime":510,"updateTime":510,"relativeEntities":511,"slug":512,"properties":513,"entityType":124,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":524,"translateLanguages":22,"viewCount":23,"primaryUrl":526,"fullTextUrl":22,"authors":527,"publicationType":190,"publisherRelationship":565,"citationCount":597,"citationInfo":598,"publishDate":600,"publishYear":601,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":22,"openAccess":22,"references":602,"isForceReanalyzing":221},"ed0b8d08-1a5b-496d-b957-3e189770292c","2024-04-16T23:54:32.229+00:00",[],"Puzzles-Art-and-Magic-with-Algorithms",{"mag":514,"keywords":516,"openalex":517,"abstract":519,"title":520,"doi":522},{"VOID":515},"2081747232",{},{"VOID":518},"W2081747232",{},{"EN":521},"Puzzles, Art, and Magic with Algorithms",{"VOID":523},"10.1007\u002Fs00224-005-1241-3",[525],"EN","http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs00224-005-1241-3",[528,550],{"id":529,"sortIndex":23,"researcher":22,"roles":530,"affiliations":531,"properties":543},"919ac26d-1787-49c5-975e-1d5d6ed9340f",[],[532],{"id":533,"sortIndex":23,"affiliation":534,"properties":22},"f518d7df-be69-4357-88f4-a23acdf6659d",{"id":535,"createTime":536,"updateTime":537,"relativeEntities":538,"slug":539,"properties":540,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"009ea67e-03ab-4719-be96-12ee72603c97","2023-12-07T09:50:00.724+00:00","2025-06-11T14:06:57.983+00:00",[],"Computer-Science-and-Artificial-Intelligence-Laboratory-MIT-Cambridge-MA-02139-USA",{"title":541},{"VI":542},"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA 02139, USA",{"openalex":544,"orcid":546,"title":548},{"VOID":545},"A5083684609",{"VOID":547},"https:\u002F\u002Forcid.org\u002F0000-0003-3803-5703",{"EN":549},"Erik D. Demaine",{"id":551,"sortIndex":176,"researcher":22,"roles":552,"affiliations":553,"properties":560},"036012e0-1c54-4cf6-80bb-c8149fe73430",[],[554],{"id":555,"sortIndex":23,"affiliation":556,"properties":22},"c910c62b-69e4-4479-afbd-fd87da060374",{"id":535,"createTime":536,"updateTime":537,"relativeEntities":557,"slug":539,"properties":558,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},[],{"title":559},{"VI":542},{"openalex":561,"title":563},{"VOID":562},"A5088731324",{"EN":564},"Martin L. Demaine",{"url":22,"publisher":566,"properties":590},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":567,"slug":10,"properties":568,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":573,"manageAffiliations":574,"indexDatabases":575,"url":22,"thumbnailPath":22,"statistic":22,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":569,"eissn":570,"title":571,"url":572},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},[],[],[576,583],{"id":86,"indexDatabase":577,"url":101,"indexYears":22,"academicFieldIds":582,"indexDatabaseRanking":22},{"id":88,"createTime":89,"updateTime":90,"relativeEntities":578,"label":579,"description":580,"key":97,"publicationTags":581,"standard":22},[],{"EN":93,"VI":93},{"VI":95,"EN":96},[99,100],[103,104],{"id":66,"indexDatabase":584,"url":79,"indexYears":80,"academicFieldIds":589,"indexDatabaseRanking":84},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":585,"label":586,"description":587,"key":76,"publicationTags":588,"standard":22},[],{"EN":73,"VI":73},{"EN":73,"VI":75},[78],[82,83],{"volume":591,"pages":593,"issue":595},{"VOID":592},"39",{"VOID":594},"473-481",{"VOID":596},"3",7,{"total":597,"publishYear":22,"statisticByYear":599},{"2012":176,"2014":176,"2015":131,"2017":176},"2006-06-01",2006,[],{"id":604,"createTime":605,"updateTime":605,"relativeEntities":606,"slug":22,"properties":607,"entityType":124,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"primaryUrl":616,"fullTextUrl":22,"authors":617,"publicationType":190,"publisherRelationship":633,"citationCount":22,"citationInfo":22,"publishDate":663,"publishYear":664,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":22,"openAccess":22,"references":22,"isForceReanalyzing":221},"dc741677-7b7c-4fa2-bb00-09c2165441cd","2023-12-25T23:52:29.401+00:00",[],{"references":608,"abstract":610,"title":612,"doi":614},{"VOID":609},"A. V. Aho, J. E. Hopcroft andJ. D. Ullman, Time and tape complexity of pushdown automaton languages,Information and Control 13 (1968), 186–206.\nS. A. Cook, Characterizations of pushdown machines in terms of time-bounded computers,J. Assoc. Comput. Mach. 18 (1971), 4–18.\nJ. Earley, An efficient context-free parsing algorithm,C. Assoc. Comput. Mach. 13 (1970), 94–102.\nJ. N. Gray, M. A. Harrison andO. H. Ibarra, Two-way pushdown automata,Information and Control 10 (1967), 30–70.\nM. A. Harrison andO. H. Ibarra, Multi-tape and multi-head pushdown automata,Information and Control 13 (1968), 433–470.\nJ. Hartmanis, P. M. Lewis andR. E. Stearns,Hierarchies of Memory Limited Computations, IEEE Conference Record 1965, 179–190.\nJ. Hartmanis andR. E. Stearns, On the computational complexity of algorithms,Trans. Amer. Math. Soc. 117 (1965), 285–306.\nJ. E. Hopcroft andJ. D. Ullman,Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.\nT. Kameda, Pushdown automata with counters,J. Computer and System Sciences 6 (1972), 138–150.\nT. Kasami, A note on computing time for recognition of languages generated by linear grammars,Information and Control 10 (1967), 209–214.\nT. Kasami andT. Torii, A syntax-analysis procedure for unambiguous context-free grammars,J. Assoc. Comput. Mach. 16 (1969), 423–431.\nB. Monien,Beziehungen zwischen Zeitkomplexitätsklassen und Kellerautomaten mit Zählern, Berichte Inst. f. Informatik d. Universität Hamburg 71\u002F1.\nD. H. Younger, Recognition and parsing of context-free languages in timen 3,Information and Control 10 (1967), 189–208.",{"EN":611},"In this paper a machine model is defined whose access to the storage cells is controlled by means of address registers. It is shown that every set acceptable by such a machine within time boundc⋅n\np,p ∈ ℕ, is accepted by a deterministic 2p-head two-way pushdown automaton which has additional counters of length log2\nn. On the other hand every set acceptable by a deterministicp-head two-way pushdown automaton can be accepted by this machine model within time boundc⋅n\np⋅log2\nn.\n",{"EN":613},"Relationships between pushdown automata with counters and complexity classes",{"VOID":615},"10.1007\u002FBF01735143","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002FBF01735143",[618],{"id":619,"sortIndex":23,"researcher":22,"roles":620,"affiliations":621,"properties":630},"452ccdca-180c-4d00-aa8b-8170575c5d4b",[133],[622],{"id":22,"sortIndex":23,"affiliation":623,"properties":22},{"id":624,"createTime":625,"updateTime":625,"relativeEntities":626,"slug":22,"properties":627,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"4e55978c-474f-42e4-a032-4f0d9ba8f40b","2023-12-25T23:52:29.486+00:00",[],{"title":628},{"VI":629},"Institut für Informatik, Universität Hamburg, Hamburg, West Germany",{"title":631},{"VI":632},"Burkhard Monien",{"url":616,"publisher":634,"properties":658},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":635,"slug":10,"properties":636,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":641,"manageAffiliations":642,"indexDatabases":643,"url":22,"thumbnailPath":22,"statistic":22,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":637,"eissn":638,"title":639,"url":640},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},[],[],[644,651],{"id":86,"indexDatabase":645,"url":101,"indexYears":22,"academicFieldIds":650,"indexDatabaseRanking":22},{"id":88,"createTime":89,"updateTime":90,"relativeEntities":646,"label":647,"description":648,"key":97,"publicationTags":649,"standard":22},[],{"EN":93,"VI":93},{"VI":95,"EN":96},[99,100],[103,104],{"id":66,"indexDatabase":652,"url":79,"indexYears":80,"academicFieldIds":657,"indexDatabaseRanking":84},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":653,"label":654,"description":655,"key":76,"publicationTags":656,"standard":22},[],{"EN":73,"VI":73},{"EN":73,"VI":75},[78],[82,83],{"volume":659,"pages":661},{"VOID":660},"9",{"VOID":662},"248-264","1975-09-01",1975,{"id":666,"createTime":667,"updateTime":668,"relativeEntities":669,"slug":670,"properties":671,"entityType":124,"verifyStatus":125,"verifyTime":668,"verifyNote":126,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"primaryUrl":680,"fullTextUrl":22,"authors":681,"publicationType":190,"publisherRelationship":697,"citationCount":22,"citationInfo":22,"publishDate":727,"publishYear":728,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":22,"openAccess":22,"references":22,"isForceReanalyzing":221},"f8a3c6f5-8379-4f2b-9930-d94d0a3d112c","2024-01-18T01:00:33.716+00:00","2025-01-10T23:52:13.312+00:00",[],"Series-Parallel-Digraphs-with-Loops",{"references":672,"abstract":674,"title":676,"doi":678},{"VOID":673},"Bodlaender, H.L., de Fluiter, B.: Parallel algorithms for series parallel graphs and graphs with treewidth two. Algorithmica 29(4), 534–559 (2001)\nBrandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Monographs on Discrete Mathematics and Applications, vol. 3 (1999)\nCaron, P., Ziadi, D.: Characterization of Glushkov automata. Theor. Comput. Sci. 233(1–2), 75–90 (2000)\nChrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47, 149–158 (1986)\nDiestel, R.: Graph Theory, 3th edn. Graduate Texts in Mathematics, vol. 173. Springer, Berlin (2006)\nEhrenfeucht, A., Zeiger, P.: Complexity measures for regular expressions. J. Comput. Syst. Sci. 12, 134–146 (1976)\nEllul, K., Krawetz, B., Shallit, J., Wang, M.W.: Regular expressions: new results and open problems. J. Autom. Lang. Comb. 10(4), 407–437 (2005)\nGelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. In: STACS, pp. 325–336 (2008)\nGiammarresi, D., Ponty, J.L., Wood, D., Ziadi, D.: A characterization of Thompson digraphs. Discrete Appl. Math. 134, 317–337 (2004)\nGruber, H., Holzer, M.: Finite automata, digraph connectivity, and regular expression size. In: ICALP 2008, Part II. LNCS, vol. 5126, pp. 39–50. Springer, Berlin (2008)\nGruber, H., Johannsen, J.: Optimal lower bounds on regular expression size using communication complexity. In: FOSSAC 2008. LNCS, vol. 4962, pp. 273–286 (2008)\nGulan, S., Fernau, H.: Local elimination-strategies in finite automata for shorter regular expressions. In: Theory and Practice of Computer Science: SOFSEM 2008, vol. 2, pp. 46–57 (2008)\nGulan, S., Fernau, H.: An optimal construction of finite automata from regular expressions. In: 28th FSTTCS, pp. 211–222 (2008)\nGulan, S.: On the relative descriptional complexity of regular expressions and finite automata. Ph.D. thesis, Universität Trier (2011)\nHopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)\nHromkovič, J., Seibert, S.: Translating regular expressions into small epsilon-free nondeterministic finite automata. J. Comput. Syst. Sci. 62, 565–588 (2001)\nHuet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM 27(4), 797–821 (1980)\nJakoby, A., Tantau, T.: Logspace algorithms for computing shortest and longest paths in series-parallel graphs. In: 27th FSTTCS, pp. 216–227 (2007)\nKleene, S.C.: Representation of events in nerve nets and finite automata. In: Annals of Mathematics Studies, pp. 3–41 (1956)\nKorenblit, M., Levit, V.E.: On algebraic expressions of series-parallel and Fibonacci graphs. In: DMTCS 2003. LNCS, vol. 2731, pp. 215–224. Springer, Berlin (2003)\nMcNaughton, R.: Techniques for manipulating regular expressions. In: Systems and Computer Science, pp. 27–41. University of Toronto Press in association with the University of Western Ontario Toronto, Toronto (1967)\nMoreira, N., Reis, R.: Series-parallel automata and short regular expressions. Fundam. Inform. 91(3–4), 611–629 (2009)\nNewman, M.: On theories with a combinatorial definition of “equivalence”. Annals of Mathematics 43(2), 223–243 (1942)\nValdes, J.: Parsing flowcharts and series-parallel graphs. Ph.D. thesis, Stanford University (1978). STAN-CS-78-682\nValdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298–313 (1981)\nWatson, B.W.: A taxonomy of finite automata construction algorithms. Tech. Rep. Computing Science Note 93\u002F43, Eindhoven University of Technology (1994)",{"EN":675},"In the conversion of finite automata to regular expressions, an exponential blowup in size can generally not be avoided. This is due to graph-structural properties of automata which cannot be directly encoded by regular expressions and cause the blowup combinatorially. In order to identify these structures, we generalize the class of arc-series-parallel digraphs beyond the acyclic case. The resulting digraphs are shown to be reversibly encoded by linear-sized regular expressions. Also, a characterization of this new class by a set of seven forbidden substructures is given. Automata that require expressions of superlinear size must contain some of these substructures.",{"EN":677},"Series Parallel Digraphs with Loops",{"VOID":679},"10.1007\u002Fs00224-012-9409-0","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs00224-012-9409-0",[682],{"id":683,"sortIndex":23,"researcher":22,"roles":684,"affiliations":685,"properties":694},"4bb22127-df9a-4508-af8e-99770675539d",[133],[686],{"id":22,"sortIndex":23,"affiliation":687,"properties":22},{"id":688,"createTime":689,"updateTime":689,"relativeEntities":690,"slug":22,"properties":691,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"dc5a7d68-2f7e-4920-aeb3-bf34a440faf5","2024-01-22T00:30:44.900+00:00",[],{"title":692},{"VI":693},"FB IV-Informatik, Universität Trier, Trier, Germany",{"title":695},{"VI":696},"Stefan Gulan",{"url":680,"publisher":698,"properties":722},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":699,"slug":10,"properties":700,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":705,"manageAffiliations":706,"indexDatabases":707,"url":22,"thumbnailPath":22,"statistic":22,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":701,"eissn":702,"title":703,"url":704},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},[],[],[708,715],{"id":86,"indexDatabase":709,"url":101,"indexYears":22,"academicFieldIds":714,"indexDatabaseRanking":22},{"id":88,"createTime":89,"updateTime":90,"relativeEntities":710,"label":711,"description":712,"key":97,"publicationTags":713,"standard":22},[],{"EN":93,"VI":93},{"VI":95,"EN":96},[99,100],[103,104],{"id":66,"indexDatabase":716,"url":79,"indexYears":80,"academicFieldIds":721,"indexDatabaseRanking":84},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":717,"label":718,"description":719,"key":76,"publicationTags":720,"standard":22},[],{"EN":73,"VI":73},{"EN":73,"VI":75},[78],[82,83],{"volume":723,"pages":725},{"VOID":724},"53",{"VOID":726},"126-158","2012-05-10",2012,{"id":730,"createTime":731,"updateTime":732,"relativeEntities":733,"slug":734,"properties":735,"entityType":124,"verifyStatus":125,"verifyTime":732,"verifyNote":126,"syncStatus":21,"languages":746,"translateLanguages":22,"viewCount":23,"primaryUrl":747,"fullTextUrl":22,"authors":748,"publicationType":190,"publisherRelationship":784,"citationCount":809,"citationInfo":810,"publishDate":812,"publishYear":813,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":22,"openAccess":22,"references":814,"isForceReanalyzing":221},"e81c23bb-a309-483c-8f75-134372a56259","2024-04-14T23:12:00.189+00:00","2024-12-25T23:51:40.471+00:00",[],"Omega-Rational-Expressions-with-Bounded-Synchronization-Delay",{"mag":736,"keywords":738,"openalex":739,"abstract":741,"title":742,"doi":744},{"VOID":737},"2044927444",{},{"VOID":740},"W2044927444",{},{"EN":743},"Omega-Rational Expressions with Bounded Synchronization Delay",{"VOID":745},"10.1007\u002Fs00224-013-9526-4",[525],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs00224-013-9526-4",[749,768],{"id":750,"sortIndex":23,"researcher":22,"roles":751,"affiliations":752,"properties":761},"837669ff-e00b-43af-b1d7-59b84c1d7217",[],[753],{"id":22,"sortIndex":23,"affiliation":754,"properties":22},{"id":755,"createTime":756,"updateTime":756,"relativeEntities":757,"slug":22,"properties":758,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"3857deb8-8cca-42d3-ac01-7364d9be7d4d","2024-02-02T06:29:56.828+00:00",[],{"title":759},{"VI":760},"FMI, University of Stuttgart, Stuttgart, Germany",{"openalex":762,"orcid":764,"title":766},{"VOID":763},"A5054093863",{"VOID":765},"https:\u002F\u002Forcid.org\u002F0000-0002-5994-3762",{"EN":767},"Volker Diekert",{"id":769,"sortIndex":176,"researcher":22,"roles":770,"affiliations":771,"properties":777},"332796d6-e091-4205-bb19-4011b376d665",[],[772],{"id":22,"sortIndex":23,"affiliation":773,"properties":22},{"id":755,"createTime":756,"updateTime":756,"relativeEntities":774,"slug":22,"properties":775,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},[],{"title":776},{"VI":760},{"openalex":778,"orcid":780,"title":782},{"VOID":779},"A5055386769",{"VOID":781},"https:\u002F\u002Forcid.org\u002F0000-0003-3869-416X",{"EN":783},"Manfred Kufleitner",{"url":22,"publisher":785,"properties":22},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":786,"slug":10,"properties":787,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":792,"manageAffiliations":793,"indexDatabases":794,"url":22,"thumbnailPath":22,"statistic":22,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":788,"eissn":789,"title":790,"url":791},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},[],[],[795,802],{"id":86,"indexDatabase":796,"url":101,"indexYears":22,"academicFieldIds":801,"indexDatabaseRanking":22},{"id":88,"createTime":89,"updateTime":90,"relativeEntities":797,"label":798,"description":799,"key":97,"publicationTags":800,"standard":22},[],{"EN":93,"VI":93},{"VI":95,"EN":96},[99,100],[103,104],{"id":66,"indexDatabase":803,"url":79,"indexYears":80,"academicFieldIds":808,"indexDatabaseRanking":84},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":804,"label":805,"description":806,"key":76,"publicationTags":807,"standard":22},[],{"EN":73,"VI":73},{"EN":73,"VI":75},[78],[82,83],9,{"total":809,"publishYear":22,"statisticByYear":811},{"2014":176,"2016":148,"2017":148,"2021":131},"2015-05-01",2015,[815,819,823,826,830,834,838,841,844,847,851,854,858,862,866,869,873],{"id":22,"text":816,"url":22,"identifiers":817},"Arnold, A.: A syntactic congruence for rational ω-languages. Theor. Comput. Sci. 39, 333–335 (1985)",{"doi":818},"10.1016\u002F0304-3975(85)90148-3",{"id":22,"text":820,"url":22,"identifiers":821},"Diekert, V., Gastin, P.: Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Inf. Comput. 204, 1597–1619 (2006). Conference version in LATIN 2004, LNCS 2976, pp. 170–182 (2004)",{"doi":822},"10.1016\u002Fj.ic.2006.07.002",{"id":22,"text":824,"url":22,"identifiers":825},"Diekert, V., Gastin, P.: First-order definable languages. In: Logic and Automata: History and Perspectives. Texts in Logic and Games, pp. 261–306. Amsterdam University Press, Amsterdam (2008)",{},{"id":22,"text":827,"url":22,"identifiers":828},"Diekert, V., Gastin, P., Kufleitner, M.: A survey on small fragments of first-order logic over finite words. Int. J. Found. Comput. Sci. 19(3), 513–548 (2008). Special issue DLT 2007",{"doi":829},"10.1142\u002FS0129054108005802",{"id":22,"text":831,"url":22,"identifiers":832},"Diekert, V., Kufleitner, M., Steinberg, B.: The Krohn-Rhodes theorem and local divisors. Fundam. Inform. 116(1–4), 65–77 (2012)",{"doi":833},"10.3233\u002FFI-2012-669",{"id":22,"text":835,"url":22,"identifiers":836},"Golomb, S.W., Gordon, B.: Codes with bounded synchronization delay. Inf. Control 8(4), 355–372 (1965)",{"doi":837},"10.1016\u002FS0019-9958(65)90300-1",{"id":22,"text":839,"url":22,"identifiers":840},"Kamp, J.A.W.: Tense logic and the theory of linear order. PhD thesis, University of California, Los Angeles (California) (1968)",{},{"id":22,"text":842,"url":22,"identifiers":843},"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)",{},{"id":22,"text":845,"url":22,"identifiers":846},"Meyberg, K.: Lectures on algebras and triple systems. Technical report, University of Virginia, Charlottesville (1972)",{},{"id":22,"text":848,"url":22,"identifiers":849},"Perrin, D.: Recent results on automata and infinite words. In: Mathematical Foundations of Computer Science, Prague, 1984. Lecture Notes in Comput. Sci., vol. 176, pp. 134–148. Springer, Berlin (1984)",{"doi":850},"10.1007\u002FBFb0030294",{"id":22,"text":852,"url":22,"identifiers":853},"Perrin, D., Pin, J.-É.: Infinite Words. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)",{},{"id":22,"text":855,"url":22,"identifiers":856},"Pin, J.-É.: Varieties of Formal Languages. North Oxford Academic, London (1986)",{"doi":857},"10.1007\u002F978-1-4613-2215-3",{"id":22,"text":859,"url":22,"identifiers":860},"Pin, J.-É., Straubing, H., Thérien, D.: Locally trivial categories and unambiguous concatenation. J. Pure Appl. Algebra 52(3), 297–311 (1988)",{"doi":861},"10.1016\u002F0022-4049(88)90097-7",{"id":22,"text":863,"url":22,"identifiers":864},"Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8, 190–194 (1965)",{"doi":865},"10.1016\u002FS0019-9958(65)90108-7",{"id":22,"text":867,"url":22,"identifiers":868},"Schützenberger, M.P.: Sur certaines opérations de fermeture dans les langages rationnels. In: Symposia Mathematica, vol. XV. Convegno di Informatica Teorica, INDAM, Roma, 1973, pp. 245–253. Academic Press, London (1975)",{},{"id":22,"text":870,"url":22,"identifiers":871},"Schützenberger, M.P.: Sur le produit de concaténation non ambigu. Semigroup Forum 13, 47–75 (1976)",{"doi":872},"10.1007\u002FBF02194921",{"id":22,"text":874,"url":22,"identifiers":875},"Tesson, P., Thérien, D.: Diamonds are forever: the variety DA. In: Semigroups, Algorithms, Automata and Languages 2001, Proceedings, pp. 475–500. World Scientific, Singapore (2002)",{"doi":876},"10.1142\u002F9789812776884_0021",{"id":878,"createTime":879,"updateTime":880,"relativeEntities":881,"slug":882,"properties":883,"entityType":124,"verifyStatus":21,"verifyTime":880,"verifyNote":892,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"primaryUrl":893,"fullTextUrl":22,"authors":894,"publicationType":190,"publisherRelationship":986,"citationCount":22,"citationInfo":22,"publishDate":1016,"publishYear":1017,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":22,"openAccess":22,"references":22,"isForceReanalyzing":221},"77d0f290-4d6c-44ca-8d08-42452f077f96","2023-12-18T18:20:10.162+00:00","2024-12-21T23:51:08.418+00:00",[],"On-Short-Paths-Interdiction-Problems-Total-and-Node-Wise-Limited-Interdiction",{"references":884,"abstract":886,"title":888,"doi":890},{"VOID":885},"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, New Jersey (1993)\nBall, M.O., Golden, B.L., Vohra, R.V.: Finding the most vital arcs in a network. Oper. Res. Lett. 8, 73–76 (1989)\nBar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes. Technical Report CS-TR-3539, University of Maryland, Institute of Advanced Computer Studies, College Park, MD (1995)\nBeffara, E., Vorobyov, S.: Adapting Gurvich-Karzanov-Khachiyan’s algorithm for parity games: implementation and experimentation. Technical Report 020, Department of Information Technology, Uppsala University (2001) (available at http:\u002F\u002Fwww.it.uu.se\u002Fresearch\u002Freports\u002F#2001)\nBeffara, E., Vorobyov, S.: Is randomized Gurvich-Karzanov-Khachiyan’s algorithm for parity games polynomial? Technical Report 025, Department of Information Technology, Uppsala University (2001) (available at http:\u002F\u002Fwww.it.uu.se\u002Fresearch\u002Freports\u002F#2001)\nBjörklund, H., Sandberg, S., Vorobyov, S.: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discret. Appl. Math. 155(2), 210–229 (2007)\nClementi, A.E.F., Crescenzi, P., Rossi, G.: On the complexity of approximating colored-graph problems. In: COCOON, pp. 281–290 (1999)\nCorely, H.W., Shaw, D.Y.: Most vital links and nodes in weighted networks. Oper. Res. Lett. 1, 157–160 (1982)\nDinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162, 439–485 (2005)\nEhrenfeucht, A., Mycielski, J.: Positional games over a graph. Not. Am. Math. Soc. 20, A-334 (1973)\nEhrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. J. Game Theory 8, 109–113 (1979)\nFredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596–615 (1987)\nFulkerson, D.R., Harding, G.C.: Maximizing the minimum source-sink path subject to a budget constraint. Math. Program. 13, 116–118 (1977)\nGallai, T.: Maximum-minimum Sätze über Graphen. Acta Math. Acad. Sci. Hung. 9, 395–434 (1958)\nGarey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)\nGhare, P.M., Montgomery, D.C., Turner, T.M.: Optimal interdiction policy for a flow network. Nav. Res. Logist. Q. 18, 37–45 (1971)\nGolden, B.L.: A problem in network interdiction. Nav. Res. Logist. Q. 25, 711–713 (1978)\nGoldschlager, L.M.: The monotone and planar circuit value problem are log space complete for P. SIGACT News 9(2), 25–29 (1977)\nGreenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford (1995)\nGurvich, V., Karzanov, A., Khachiyan, L.: Cyclic games and an algorithm to find minimax cycle means in directed graphs. USSR Comput. Math. Math. Phys. 28, 85–91 (1988)\nHåstad, J.: Some optimal inapproximability results. In: STOC ’97: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 1–10. ACM Press (1997)\nIsraely, E., Wood, K.: Shortest-path network interdiction. Networks 40(2), 97–111 (2002)\nJurdzinski, M., Paterson, M., Zwick, U.: A deterministic subexponential algorithm for solving parity games. In: SODA 2006, pp. 117–123\nKarakostas, G.: A better approximation ratio for the vertex cover problem. In: ICALP, pp. 1043–1050 (2005)\nKarp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)\nKarp, R.: A characterization of the minimum cycle mean in a digraph. Discret. Math. 23, 309–311 (1978)\nKarzanov, A.V., Lebedev, V.N.: Cyclical games with prohibition. Math. Program. 60, 277–293 (1993)\nMalik, K., Mittal, A.K., Gupta, S.K.: The k most vital arcs in the shortest path problem. Oper. Res. Lett. 8, 223–227 (1989)\nMcMasters, A.W., Mustin, T.M.: Optimal interdiction of a supply networks. Nav. Res. Logist. Q. 17, 261–268 (1970)\nMoulin, H.: Prolongement des jeux à deux joueurs de somme nulle. Bull. Soc. Math. France, Memoire 45 (1976)\nMoulin, H.: Extension of two person zero sum games. J. Math. Anal. Appl. 55(2), 490–507 (1976)\nPhillips, C.A.: The network inhibition problem. In: Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 776–785 (1993)\nPisaruk, N.N.: Mean cost cyclical games. Math. Oper. Res. 24(4), 817–828 (1999)\nPoljak, S.: A note on the stable sets and coloring of graphs. Comment. Math. Univ. Carol. 15, 307–309 (1974)\nSchrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, New York (2003)\nVazirani, V.: Approximation Algorithms. Springer, Berlin (2001)\nWagner, D.K.: Disjoint (s,t)-cuts in a network. Networks 20, 361–371 (1990)\nWashburn, A., Wood, K.: Two-person zero-sum games for network interdiction. Oper. Res. 43(2), 243–251 (1995)\nWood, R.K.: Deterministic network interdiction. Math. Comput. Model. 17, 1–18 (1993)\nZwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158(1–2), 343–359 (1996)",{"EN":887},"\nGiven a directed graph G=(V,A) with a non-negative weight (length) function on its arcs w:A→ℝ+ and two terminals s,t∈V, our goal is to destroy all short directed paths from s to t in G by eliminating some arcs of A. This is known as the short paths interdiction problem. We consider several versions of it, and in each case analyze two subcases: total limited interdiction, when a fixed number k of arcs can be removed, and node-wise limited interdiction, when for each node v∈V a fixed number k(v) of out-going arcs can be removed. Our results indicate that the latter subcase is always easier than the former one. In particular, we show that the short paths node-wise interdiction problem can be efficiently solved by an extension of Dijkstra’s algorithm. In contrast, the short paths total interdiction problem is known to be NP-hard. We strengthen this hardness result by deriving the following inapproximability bounds: Given k, it is NP-hard to approximate within a factor c\u003C2 the maximum s–t distance d(s,t) obtainable by removing (at most) k arcs from G. Furthermore, given d, it is NP-hard to approximate within a factor \n\n                \n                  \n                \n                $c\u003C10\\sqrt{5}-21\\approx1.36$\n               \nthe minimum number of arcs which has to be removed to guarantee d(s,t)≥d. Finally, we also show that the same inapproximability bounds hold for undirected graphs and\u002For node elimination.\n",{"EN":889},"On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction",{"VOID":891},"10.1007\u002Fs00224-007-9025-6","Author affiliation is blank","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs00224-007-9025-6",[895,910,925,937,950,966,979],{"id":896,"sortIndex":148,"researcher":22,"roles":897,"affiliations":898,"properties":907},"678b9870-02e4-4689-b1d4-f8f1c9418707",[133],[899],{"id":22,"sortIndex":23,"affiliation":900,"properties":22},{"id":901,"createTime":902,"updateTime":902,"relativeEntities":903,"slug":22,"properties":904,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"6746cb65-21e6-4ba1-a3ec-a0840eb43bad","2023-12-18T18:20:10.198+00:00",[],{"title":905},{"VI":906},"Max-Planck-Institüt für Informatik, Saarbrücken, Germany",{"title":908},{"VI":909},"Khaled Elbassioni",{"id":911,"sortIndex":131,"researcher":22,"roles":912,"affiliations":913,"properties":922},"cd219ab4-3588-4ab9-b5ca-ab90e36634c5",[133],[914],{"id":22,"sortIndex":23,"affiliation":915,"properties":22},{"id":916,"createTime":917,"updateTime":917,"relativeEntities":918,"slug":22,"properties":919,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"95a6ee62-e98a-4321-a2e2-7a7430d2b41d","2024-01-25T00:44:30.387+00:00",[],{"title":920},{"VI":921},"RUTCOR, Rutgers University, Piscataway, USA",{"title":923},{"VI":924},"Konrad Borys",{"id":926,"sortIndex":176,"researcher":22,"roles":927,"affiliations":928,"properties":934},"397d4d97-0f22-4f04-b1c8-1b924bd17f09",[133],[929],{"id":22,"sortIndex":23,"affiliation":930,"properties":22},{"id":916,"createTime":917,"updateTime":917,"relativeEntities":931,"slug":22,"properties":932,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},[],{"title":933},{"VI":921},{"title":935},{"VI":936},"Endre Boros",{"id":938,"sortIndex":939,"researcher":22,"roles":940,"affiliations":941,"properties":947},"86a26d51-a09d-469e-ab56-e136e84b2382",5,[133],[942],{"id":22,"sortIndex":23,"affiliation":943,"properties":22},{"id":916,"createTime":917,"updateTime":917,"relativeEntities":944,"slug":22,"properties":945,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},[],{"title":946},{"VI":921},{"title":948},{"VI":949},"Gabor Rudolf",{"id":951,"sortIndex":952,"researcher":22,"roles":953,"affiliations":954,"properties":963},"9cb575b1-4793-4c09-8e6b-7032cdfae395",6,[133],[955],{"id":22,"sortIndex":23,"affiliation":956,"properties":22},{"id":957,"createTime":958,"updateTime":958,"relativeEntities":959,"slug":22,"properties":960,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},"174d7000-a145-4169-8153-11fe76301c8a","2024-01-14T12:03:20.834+00:00",[],{"title":961},{"VI":962},"Department of Computer Science, Rutgers University, Piscataway, USA",{"title":964},{"VI":965},"Jihui Zhao",{"id":967,"sortIndex":968,"researcher":22,"roles":969,"affiliations":970,"properties":976},"a77d81d9-a857-4a5e-aec3-f68746561dbb",4,[133],[971],{"id":22,"sortIndex":23,"affiliation":972,"properties":22},{"id":916,"createTime":917,"updateTime":917,"relativeEntities":973,"slug":22,"properties":974,"entityType":51,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23},[],{"title":975},{"VI":921},{"title":977},{"VI":978},"Vladimir Gurvich",{"id":980,"sortIndex":23,"researcher":22,"roles":981,"affiliations":982,"properties":983},"f70c14c5-316b-4741-b320-e983efc52614",[133],[],{"title":984},{"VI":985},"Leonid Khachiyan",{"url":893,"publisher":987,"properties":1011},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":988,"slug":10,"properties":989,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"syncStatus":21,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":994,"manageAffiliations":995,"indexDatabases":996,"url":22,"thumbnailPath":22,"statistic":22,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":990,"eissn":991,"title":992,"url":993},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},[],[],[997,1004],{"id":86,"indexDatabase":998,"url":101,"indexYears":22,"academicFieldIds":1003,"indexDatabaseRanking":22},{"id":88,"createTime":89,"updateTime":90,"relativeEntities":999,"label":1000,"description":1001,"key":97,"publicationTags":1002,"standard":22},[],{"EN":93,"VI":93},{"VI":95,"EN":96},[99,100],[103,104],{"id":66,"indexDatabase":1005,"url":79,"indexYears":80,"academicFieldIds":1010,"indexDatabaseRanking":84},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":1006,"label":1007,"description":1008,"key":76,"publicationTags":1009,"standard":22},[],{"EN":73,"VI":73},{"EN":73,"VI":75},[78],[82,83],{"volume":1012,"pages":1014},{"VOID":1013},"43",{"VOID":1015},"204-233","2007-07-10",2007]