Tóth, Csaba D. Plane multigraphs with one-bend and circular-arc edges of a fixed angle. (English) Zbl 07883858 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 18th international conference and workshops on algorithms and computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024. Proceedings. Singapore: Springer. Lect. Notes Comput. Sci. 14549, 15-31 (2024). MSC: 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Zeinalzadeh, A.; Kamakoli, G. Hosseinzadeh; Pakatchian, M. R. A hybrid data-driven framework for loss prediction of MCA airfoils. (English) Zbl 07855390 Eng. Anal. Bound. Elem. 163, 394-405 (2024). MSC: 76-XX 68-XX × Cite Format Result Cite Review PDF Full Text: DOI
Jana, Satyabrata; Saha, Souvik; Sahu, Abhishek; Saurabh, Saket; Verma, Shaily Partitioning subclasses of chordal graphs with few deletions. (English) Zbl 07784205 Theor. Comput. Sci. 983, Article ID 114288, 10 p. (2024). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI
Cao, Yixin; Yuan, Hanchun; Wang, Jianxin Modification problems toward proper (Helly) circular-arc graphs. (English) Zbl 07953280 Leroux, Jérôme (ed.) et al., 48th international symposium on mathematical foundations of computer science, MFCS 2023, Bordeaux, France, August 28 – September 1, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 272, Article 31, 14 p. (2023). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Golestanian, Mahmoud; Casquero, Hugo Extending CAS elements to remove shear and membrane locking from quadratic NURBS-based discretizations of linear plane Timoshenko rods. (English) Zbl 1542.74074 Int. J. Numer. Methods Eng. 124, No. 18, 3997-4021 (2023). MSC: 74S22 74S05 74K10 × Cite Format Result Cite Review PDF Full Text: DOI
Jana, Satyabrata; Saha, Souvik; Sahu, Abhishek; Saurabh, Saket; Verma, Shaily Partitioning subclasses of chordal graphs with few deletions. (English) Zbl 07745714 Mavronicolas, Marios (ed.), Algorithms and complexity. 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13898, 293-307 (2023). MSC: 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI
Yoon, Hyeong Moon; Ahn, Young Joon Circular arc approximation by hexic polynomial curves. (English) Zbl 1538.65038 Comput. Appl. Math. 42, No. 6, Paper No. 265, 14 p. (2023). MSC: 65D17 41A10 × Cite Format Result Cite Review PDF Full Text: DOI
Žagar, Emil Arc length preserving \(G^2\) Hermite interpolation of circular arcs. (English) Zbl 1512.65034 J. Comput. Appl. Math. 424, Article ID 115008, 12 p. (2023). MSC: 65D17 65D05 65D07 × Cite Format Result Cite Review PDF Full Text: DOI
Chakraborty, Sankardeep; Jo, Seungbum Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number. (English) Zbl 1543.68272 Theor. Comput. Sci. 941, 156-166 (2023). MSC: 68R10 05C62 68P05 × Cite Format Result Cite Review PDF Full Text: DOI
Hsu, Kevin; Huang, Jing Obstructions for acyclic local tournament orientation completions. (English) Zbl 1504.05107 Discrete Math. 346, No. 2, Article ID 113220, 9 p. (2023). MSC: 05C20 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Fiala, Jiří; Rutter, Ignaz; Stumpf, Peter; Zeman, Peter Extending partial representations of circular-arc graphs. (English) Zbl 07682413 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 230-243 (2022). MSC: 68R10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bhore, Sujoy; Jana, Satyabrata; Pandit, Supantha; Roy, Sasanka The balanced connected subgraph problem for geometric intersection graphs. (English) Zbl 1537.68114 Theor. Comput. Sci. 929, 69-80 (2022). MSC: 68R10 05C62 05C85 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Safe, Martín D. Essential obstacles to Helly circular-arc graphs. (English) Zbl 1504.05199 Discrete Appl. Math. 320, 245-258 (2022). Reviewer: Brahadeesh Sankarnarayanan (Mumbai) MSC: 05C62 05C75 05C85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Groshaus, Marina Esther; Pires Guedes, André Luiz; Kolberg, Fabricio Schiavon Subclass hierarchy on circular arc bigraphs. (English) Zbl 07842434 Mat. Contemp. 48, 74-83 (2021). MSC: 05C62 × Cite Format Result Cite Review PDF Full Text: DOI
Dobson, María Patricia; Leoni, Valeria Alejandra; Lopez Pujato, María Inés \(k\)-tuple and \(k\)-tuple total dominations on web graphs. (English) Zbl 07842430 Mat. Contemp. 48, 31-41 (2021). MSC: 05C69 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Bousquet, Nicolas; Joffard, Alice TS-reconfiguration of dominating sets in circle and circular-arc graphs. (English) Zbl 07530228 Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 114-134 (2021). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Johnson, Matthew; Paulusma, Daniël; van Leeuwen, Erik Jan What graphs are \(2\)-dot product graphs? (English) Zbl 07467603 Int. J. Comput. Geom. Appl. 31, No. 1, 1-16 (2021). MSC: 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Armstrong, Santiago; Guzmán, Cristóbal; Sing-Long, Carlos A. An optimal algorithm for strict circular seriation. (English) Zbl 1529.68190 SIAM J. Math. Data Sci. 3, No. 4, 1223-1250 (2021). MSC: 68R10 05C50 05C65 05C85 06A07 68T09 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Zhong, Jun; Ross, Shane D. Differential correction and arc-length continuation applied to boundary value problems: examples based on snap-through of circular arches. (English) Zbl 1481.74478 Appl. Math. Modelling 97, 81-95 (2021). MSC: 74K10 74G60 34B15 65L10 × Cite Format Result Cite Review PDF Full Text: DOI
Soulignac, Francisco J. A certifying and dynamic algorithm for the recognition of proper circular-arc graphs. (English) Zbl 1517.05170 Theor. Comput. Sci. 889, 105-134 (2021). MSC: 05C85 05C62 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Daescu, Ovidiu; Teo, Ka Yaw Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment. (English) Zbl 1516.68102 Comput. Geom. 96, Article ID 101756, 21 p. (2021). MSC: 68U05 68P05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Safe, Martín D. Circularly compatible ones, \(D\)-circularity, and proper circular-arc bigraphs. (English) Zbl 1462.05311 SIAM J. Discrete Math. 35, No. 2, 707-751 (2021). MSC: 05C75 05C62 05C85 05C20 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Vavpetič, Aleš; Žagar, Emil On optimal polynomial geometric interpolation of circular arcs according to the Hausdorff distance. (English) Zbl 1467.65011 J. Comput. Appl. Math. 392, Article ID 113491, 14 p. (2021). MSC: 65D05 65D07 65D17 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Schiefermayr, Klaus; Zinchenko, Maxim Norm estimates for Chebyshev polynomials, I. (English) Zbl 1462.41012 J. Approx. Theory 265, Article ID 105561, 14 p. (2021). Reviewer: D. K. Ugulava (Tbilisi) MSC: 41A50 30C10 30E10 × Cite Format Result Cite Review PDF Full Text: DOI
Abuzaid, Ali H. Identifying density-based local outliers in medical multivariate circular data. (English) Zbl 07934266 Stat. Med. 39, No. 21, 2793-2798 (2020). MSC: 62P10 × Cite Format Result Cite Review PDF Full Text: DOI
Groshaus, M.; Guedes, A. L. P.; Kolberg, F. S. On the Helly subclasses of interval bigraphs and circular arc bigraphs. (English) Zbl 07600809 Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 637-648 (2020). MSC: 68Qxx 68Rxx 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI
Alpan, Gökalp; Zinchenko, Maxim On the Widom factors for \(L_p\) extremal polynomials. (English) Zbl 1452.41003 J. Approx. Theory 259, Article ID 105480, 18 p. (2020). Reviewer: Klaus Schiefermayr (Wels) MSC: 41A17 33C45 41A44 42C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Teo, Ka Yaw; Daescu, Ovidiu; Fox, Kyle Trajectory planning for an articulated probe. (English) Zbl 1476.68291 Comput. Geom. 90, Article ID 101655, 14 p. (2020). MSC: 68U05 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Webb, Marcus; Coppé, Vincent; Huybrechs, Daan Pointwise and uniform convergence of Fourier extensions. (English) Zbl 1444.42003 Constr. Approx. 52, No. 1, 139-175 (2020). MSC: 42A10 41A17 65T40 42C15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bonomo-Braberman, Flavia; Galby, Esther; Gonzalez, Carolina Lucía Characterising circular-arc contact \(B_0\)-VPG graphs. (English) Zbl 1442.05136 Discrete Appl. Math. 283, 435-443 (2020). MSC: 05C62 68R10 68U05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Martin, Barnaby; Paulusma, Daniël; van Leeuwen, Erik Jan Disconnected cuts in claw-free graphs. (English) Zbl 1450.05073 J. Comput. Syst. Sci. 113, 60-75 (2020). MSC: 05C76 05C70 × Cite Format Result Cite Review PDF Full Text: DOI Link
Vavpetič, Aleš Optimal parametric interpolants of circular arcs. (English) Zbl 1505.65099 Comput. Aided Geom. Des. 80, Article ID 101891, 8 p. (2020). MSC: 65D17 41A50 65D05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Safe, Martín D. Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property. (English) Zbl 1495.05067 J. Graph Theory 93, No. 2, 268-298 (2020). MSC: 05C10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Groshaus, Marina; Guedes, André L. P.; Kolberg, Fabricio Schiavon Subclasses of circular-arc bigraphs: Helly, normal and proper. (English) Zbl 07515206 Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 497-509 (2019). MSC: 05C75 05C85 × Cite Format Result Cite Review PDF Full Text: DOI
Bernardi, João Pedro W.; da Silva, Murilo V. G.; Guedes, André Luiz P.; Zatesko, Leandro M. The chromatic index of proper circular-arc graphs of odd maximum degree which are chordal. (English) Zbl 07515174 Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 125-133 (2019). MSC: 05C15 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Yuan, Tian-Chen; Yang, Jian; Chen, Li-Qun Nonlinear vibration analysis of a circular composite plate harvester via harmonic balance. (English) Zbl 1483.74046 Acta Mech. Sin. 35, No. 4, 912-925 (2019). MSC: 74H45 74K20 × Cite Format Result Cite Review PDF Full Text: DOI
Bhore, Sujoy; Jana, Satyabrata; Pandit, Supantha; Roy, Sasanka Balanced connected subgraph problem in geometric intersection graphs. (English) Zbl 1434.68347 Li, Yingshu (ed.) et al., Combinatorial optimization and applications. 13th international conference, COCOA 2019, Xiamen, China, December 13–15, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11949, 56-68 (2019). MSC: 68R10 05C15 05C62 68Q17 68W40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Schiefermayr, Klaus Chebyshev polynomials on circular arcs. (English) Zbl 1449.30080 Acta Sci. Math. 85, No. 3-4, 629-649 (2019). Reviewer: Konstantin Malyutin (Kursk) MSC: 30E10 30C10 33E05 41A50 × Cite Format Result Cite Review PDF Full Text: DOI
Jüttler, Bert; Maroscheck, Sofia; Kim, Myung-Soo; Hong, Q. Youn Arc fibrations of planar domains. (English) Zbl 1505.65065 Comput. Aided Geom. Des. 71, 105-118 (2019). MSC: 65D17 65N30 74S05 × Cite Format Result Cite Review PDF Full Text: DOI
Dorst, Leo Boolean combination of circular arcs using orthogonal spheres. (English) Zbl 1417.51014 Adv. Appl. Clifford Algebr. 29, No. 3, Paper No. 41, 21 p. (2019). MSC: 51K05 15A66 51N20 × Cite Format Result Cite Review PDF Full Text: DOI
Bauer, Ulrich; Lauf, Wolfgang Conformal mapping onto a doubly connected circular arc polygonal domain. (English) Zbl 1429.30014 Comput. Methods Funct. Theory 19, No. 1, 77-96 (2019). Reviewer: Agnieszka Wisniowska-Wajnryb (Rzeszow) MSC: 30C20 30C30 × Cite Format Result Cite Review PDF Full Text: DOI
Reyes, Rosalío; Rodríguez, José M.; Sigarreta, José M.; Villeta, María On the hyperbolicity constant of circular-arc graphs. (English) Zbl 1414.05095 Discrete Appl. Math. 263, 244-256 (2019). MSC: 05C10 05C76 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Galby, Esther; Mazzoleni, María Pía; Ries, Bernard Proper circular arc graphs as intersection graphs of paths on a grid. (English) Zbl 1411.05144 Discrete Appl. Math. 262, 195-202 (2019). MSC: 05C38 05C76 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Valadkhan, Payam List matrix partitions of graphs representing geometric configurations. (English) Zbl 1409.05165 Discrete Appl. Math. 260, 237-243 (2019). MSC: 05C70 05C62 × Cite Format Result Cite Review PDF Full Text: DOI
Vavpetič, Aleš; Žagar, Emil A general framework for the optimal approximation of circular arcs by parametric polynomial curves. (English) Zbl 1401.65021 J. Comput. Appl. Math. 345, 146-158 (2019). MSC: 65D05 65D07 65D17 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Ramdhani, Satesh; Tripathi, Ram; Keating, Jerome; Balakrishnan, Narayanaswamy Underground storage tanks (UST): a closer investigation statistical implications to changing the shape of a UST. (English) Zbl 07550155 Commun. Stat., Simulation Comput. 47, No. 9, 2612-2623 (2018). MSC: 62P12 68U20 × Cite Format Result Cite Review PDF Full Text: DOI
Wang, Xu Debonded arc-shaped interface anticracks. (English) Zbl 1446.74204 Math. Mech. Solids 23, No. 10, 1407-1419 (2018). MSC: 74R10 74E05 74S70 × Cite Format Result Cite Review PDF Full Text: DOI
Makarov, A. A. On example of circular arc approximation by quadratic minimal splines. (English) Zbl 1438.41028 Poincare J. Anal. Appl. 2018, No. 2, Spec. Iss., 103-107 (2018). MSC: 41A35 65D07 × Cite Format Result Cite Review PDF
Rababah, Abedallah Best sextic approximation of circular arcs with thirteen equioscillations. (English) Zbl 1403.41009 Proc. Jangjeon Math. Soc. 21, No. 1, 111-123 (2018). MSC: 41A50 41A10 41A25 65D17 × Cite Format Result Cite Review PDF
Chandoo, Maurice Canonical representations for circular-arc graphs using flip sets. (English) Zbl 1397.05118 Algorithmica 80, No. 12, 3646-3672 (2018). MSC: 05C62 05C60 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Ahmed, Delbrin; Czédli, Gábor; Horváth, Eszter K. Geometric constructibility of polygons lying on a circular arc. (English) Zbl 1395.51012 Mediterr. J. Math. 15, No. 3, Paper No. 133, 14 p. (2018). MSC: 51M04 12D05 51M15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Knez, Marjeta; Žagar, Emil Interpolation of circular arcs by parametric polynomials of maximal geometric smoothness. (English) Zbl 1441.65030 Comput. Aided Geom. Des. 63, 66-77 (2018). MSC: 65D18 65D05 65D17 × Cite Format Result Cite Review PDF Full Text: DOI
Bang-Jensen, J.; Huang, J.; Zhu, X. Completing orientations of partially oriented graphs. (English) Zbl 1386.05121 J. Graph Theory 87, No. 3, 285-304 (2018). MSC: 05C62 05C20 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Žagar, Emil Circular sector area preserving approximation of circular arcs by geometrically smooth parametric polynomials. (English) Zbl 1382.65048 J. Comput. Appl. Math. 336, 63-71 (2018). MSC: 65D17 65D05 × Cite Format Result Cite Review PDF Full Text: DOI
Brummer, Stephan; Maier, Georg; Sauer, Tomas Numerically robust computation of circular visibility. (English) Zbl 1381.65018 Comput. Aided Geom. Des. 59, 17-31 (2018). MSC: 65D18 65D07 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Alcón, Liliana; Bonomo, Flavia; Durán, Guillermo; Gutierrez, Marisa; Mazzoleni, María Pía; Ries, Bernard; Valencia-Pabon, Mario On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. (English) Zbl 1441.05121 Discrete Appl. Math. 234, 12-21 (2018). MSC: 05C38 05C60 × Cite Format Result Cite Review PDF Full Text: DOI Link
Cook, Kathryn; Eschen, Elaine M.; Sritharan, R.; Wang, Xiaoqiang Completing colored graphs to meet a target property. (English) Zbl 1464.05147 Discrete Appl. Math. 223, 39-51 (2017). MSC: 05C15 05C85 68Q17 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Kurnosenko, Alexey I. On the length preserving approximation of plane curves by circular arcs. (English. Russian original) Zbl 1382.65045 Comput. Math. Math. Phys. 57, No. 4, 590-606 (2017); translation from Zh. Vychisl. Mat. Mat. Fiz. 57, No. 4, 588-604 (2017). Reviewer: Krzystof Gdawiec (Sosnowiec) MSC: 65D17 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Adamaszek, Michał; Adams, Henry The Vietoris-Rips complexes of a circle. (English) Zbl 1366.05124 Pac. J. Math. 290, No. 1, 1-40 (2017). MSC: 05E45 55U10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Hartinger, Tatiana Romina; Milanič, Martin Partial characterizations of 1-perfectly orientable graphs. (English) Zbl 1365.05109 J. Graph Theory 85, No. 2, 378-394 (2017). MSC: 05C20 05C75 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Das, Ashok Kumar; Chakraborty, Ritapa Graphs and digraphs represented by intervals and circular arcs. (English) Zbl 1365.05107 Discrete Appl. Math. 228, 41-49 (2017). MSC: 05C20 × Cite Format Result Cite Review PDF Full Text: DOI
Zygmunt, Mariusz Circular arc approximation using polygons. (English) Zbl 1372.52010 J. Comput. Appl. Math. 322, 81-85 (2017). Reviewer: T. D. Narang (Amritsar) MSC: 52A27 × Cite Format Result Cite Review PDF Full Text: DOI
Soulignac, Francisco J. Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. I: Theory. (English) Zbl 1361.05089 J. Graph Algorithms Appl. 21, No. 4, 455-489 (2017). MSC: 05C62 05C85 × Cite Format Result Cite Review PDF Full Text: DOI
Gurski, Frank; Poullie, Patrick Gwydion Interval routing schemes for circular-arc graphs. (English) Zbl 1360.68646 Int. J. Found. Comput. Sci. 28, No. 1, 39-60 (2017). MSC: 68R10 05C62 68M10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Cao, Yixin Unit interval editing is fixed-parameter tractable. (English) Zbl 1359.68230 Inf. Comput. 253, Part 1, 109-126 (2017). MSC: 68R10 05C62 05C85 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg Circular-arc hypergraphs: rigidity via connectedness. (English) Zbl 1358.05204 Discrete Appl. Math. 217, Part 2, 220-228 (2017). MSC: 05C65 05C40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Liang, Zuosong; Shan, Erfang; Zhang, Yuzhong A linear-time algorithm for clique-coloring problem in circular-arc graphs. (English) Zbl 1358.05110 J. Comb. Optim. 33, No. 1, 147-155 (2017). MSC: 05C15 05C69 × Cite Format Result Cite Review PDF Full Text: DOI
Cao, Yixin; Grippo, Luciano N.; Safe, Martín D. Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection. (English) Zbl 1350.05104 Discrete Appl. Math. 216, Part 1, 67-83 (2017). MSC: 05C60 05C85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Moran, C. A. J.; Biggs, N. R. T.; Chamberlain, P. G. Embedding formulae for wave diffraction by a circular arc. (English) Zbl 1524.35165 Wave Motion 67, 32-46 (2016). MSC: 35J05 35P25 76B15 76Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Héra, K.; Laczkovich, M. The Kakeya problem for circular arcs. (English) Zbl 1399.28004 Acta Math. Hung. 150, No. 2, 479-511 (2016). MSC: 28A75 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Rababah, Abedallah The best uniform quadratic approximation of circular arcs with high accuracy. (English) Zbl 1347.41008 Open Math. 14, 118-127 (2016). MSC: 41A10 41A25 41A50 65D17 65D18 × Cite Format Result Cite Review PDF Full Text: DOI
Adamaszek, Michał; Adams, Henry; Frick, Florian; Peterson, Chris; Previte-Johnson, Corrine Nerve complexes of circular arcs. (English) Zbl 1354.05149 Discrete Comput. Geom. 56, No. 2, 251-273 (2016). Reviewer: Peter Dukes (Victoria) MSC: 05E45 05C40 05C15 55U10 55P15 52B15 68R05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in circular-arc graphs in linear time. (English) Zbl 1345.05051 Theor. Comput. Sci. 640, 70-83 (2016). MSC: 05C38 05C85 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg On the isomorphism problem for Helly circular-arc graphs. (English) Zbl 1336.05093 Inf. Comput. 247, 266-277 (2016). MSC: 05C60 05C62 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Moon, Sunghwan Inversion of the spherical Radon transform on spheres through the origin using the regular Radon transform. (English) Zbl 1332.44001 Commun. Pure Appl. Anal. 15, No. 3, 1029-1039 (2016). MSC: 44A12 65R10 92C55 × Cite Format Result Cite Review PDF Full Text: DOI
Das, Ashok Kumar; Das, Sandip; Sen, Malay Forbidden substructure for interval digraphs/bigraphs. (English) Zbl 1327.05132 Discrete Math. 339, No. 2, 1028-1051 (2016). MSC: 05C20 × Cite Format Result Cite Review PDF Full Text: DOI
Lin, Min Chih; Mizrahi, Michel J.; Szwarcfiter, Jayme L. Efficient and perfect domination on circular-arc graphs. (English) Zbl 1347.05146 Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 307-312, electronic only (2015). MSC: 05C69 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Alcón, Liliana; Bonomo, Flavia; Durán, Guillermo; Gutierrez, Marisa; Mazzoleni, María Pía; Ries, Bernard; Valencia-Pabon, Mario On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. (English) Zbl 1347.05128 Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 249-254, electronic only (2015). MSC: 05C62 05C38 05C85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Paul, Satyabrata; Pal, Madhumangal; Pal, Anita \(L(2,1)\)-labeling of interval graphs. (English) Zbl 1326.05134 J. Appl. Math. Comput. 49, No. 1-2, 419-432 (2015). Reviewer: Zhizhang Shen (Plymouth) MSC: 05C78 05C85 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Joos, Felix A note on longest paths in circular arc graphs. (English) Zbl 1317.05102 Discuss. Math., Graph Theory 35, No. 3, 419-426 (2015). MSC: 05C38 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Lin, Ching-Chi; Tu, Hai-Lun A linear-time algorithm for paired-domination on circular-arc graphs. (English) Zbl 1322.05130 Theor. Comput. Sci. 591, 99-105 (2015). MSC: 05C85 05C62 05C69 05C70 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Soulignac, Francisco J. Fully dynamic recognition of proper circular-arc graphs. (English) Zbl 1323.05125 Algorithmica 71, No. 4, 904-968 (2015). Reviewer: Vladimír Lacko (Košice) MSC: 05C85 05C62 05C40 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Das, Ashok Kumar; Chakraborty, Ritapa New characterizations of proper interval bigraphs and proper circular arc bigraphs. (English) Zbl 1391.05185 Ganguly, Sumit (ed.) et al., Algorithms and discrete applied mathematics. First international conference, CALDAM 2015, Kanpur, India, February 8–10, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-14973-8/pbk). Lecture Notes in Computer Science 8959, 117-125 (2015). MSC: 05C62 05C75 05C69 × Cite Format Result Cite Review PDF Full Text: DOI
Aichholzer, Oswin; Aigner, Wolfgang; Aurenhammer, Franz; Dobiášová, Kateřina Čech; Jüttler, Bert; Rote, Günter Triangulations with circular arcs. (English) Zbl 1306.05167 J. Graph Algorithms Appl. 19, No. 1, 43-65 (2015). MSC: 05C62 × Cite Format Result Cite Review PDF Full Text: DOI
Francis, Mathew; Hell, Pavol; Stacho, Juraj Blocking quadruple: a new obstruction to circular-arc graphs. (English) Zbl 1298.05234 SIAM J. Discrete Math. 28, No. 2, 631-655 (2014). MSC: 05C62 05C10 05C75 × Cite Format Result Cite Review PDF Full Text: DOI
Tan, Ngo Dac On \(d\)-arc-dominated oriented graphs. (English) Zbl 1298.05149 Graphs Comb. 30, No. 4, 1045-1054 (2014). MSC: 05C20 05C75 05C69 × Cite Format Result Cite Review PDF Full Text: DOI
Adiga, Abhijin; Babu, Jasine; Chandran, L. Sunil A constant factor approximation algorithm for boxicity of circular arc graphs. (English) Zbl 1300.05188 Discrete Appl. Math. 178, 1-18 (2014). MSC: 05C62 68W25 × Cite Format Result Cite Review PDF Full Text: DOI
Bonomo, Flavia; Durán, Guillermo; Safe, Martín Darío; Wagler, Annegret Katrin Balancedness of subclasses of circular-arc graphs. (English) Zbl 1294.05079 Discrete Math. Theor. Comput. Sci. 16, No. 3, 1-22 (2014). MSC: 05C17 05C60 × Cite Format Result Cite Review PDF Full Text: Link
Durán, Guillermo; Grippo, Luciano N.; Safe, Martín D. Structural results on circular-arc graphs and circle graphs: a survey and the main open problems. (English) Zbl 1288.05054 Discrete Appl. Math. 164, Part 2, 427-443 (2014). MSC: 05C10 05C75 × Cite Format Result Cite Review PDF Full Text: DOI
Mertzios, George B.; Bezáková, Ivona Computing and counting longest paths on circular-arc graphs in polynomial time. (English) Zbl 1288.05137 Discrete Appl. Math. 164, Part 2, 383-399 (2014). MSC: 05C38 05C35 05C85 68W25 90C39 × Cite Format Result Cite Review PDF Full Text: DOI
Kim, Soo Won; Ahn, Young Joon Circle approximation by quartic \(g^2\) spline using alternation of error function. (English) Zbl 1316.65021 J. Korean Soc. Ind. Appl. Math. 17, No. 3, 171-179 (2013). MSC: 65D07 65D17 × Cite Format Result Cite Review PDF Full Text: DOI
Eppstein, David The graphs of planar soap bubbles. (English) Zbl 1305.68229 Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17–20, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2031-3). 27-36 (2013). MSC: 68U05 05C10 05C40 05C62 68R10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Zeng, Zhenbing; Chen, Mingyan How to draw a better approximate ellipse with eight piecewise circular arcs? (Chinese. English summary) Zbl 1313.51013 Math. Pract. Theory 43, No. 23, 175-181 (2013). MSC: 51N05 × Cite Format Result Cite Review PDF
Curtis, Andrew R.; Lin, Min Chih; McConnell, Ross M.; Nussbaum, Yahav; Soulignac, Francisco J.; Spinrad, Jeremy P.; Szwarcfiter, Jayme L. Isomorphism of graph classes related to the circular-ones property. (English) Zbl 1283.05172 Discrete Math. Theor. Comput. Sci. 15, No. 1, 157-182 (2013). MSC: 05C51 68W99 05C60 68R10 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Basu, Asim; Das, Sandip; Ghosh, Shamik; Sen, Malay Circular-arc bigraphs and its subclasses. (English) Zbl 1269.05025 J. Graph Theory 73, No. 3-4, 361-376 (2013). MSC: 05C10 05C20 × Cite Format Result Cite Review PDF Full Text: DOI
van ’t Hof, Pim; Villanger, Yngve Proper interval vertex deletion. (English) Zbl 1262.68052 Algorithmica 65, No. 4, 845-867 (2013). MSC: 68Q25 05C85 × Cite Format Result Cite Review PDF Full Text: DOI
Lin, Ching-Chi; Chen, Gen-Huey; Chang, Gerard J. A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs. (English) Zbl 1263.05014 Algorithmica 66, No. 2, 369-396 (2013). MSC: 05C05 05C85 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. Normal Helly circular-arc graphs and its subclasses. (English) Zbl 1263.05064 Discrete Appl. Math. 161, No. 7-8, 1037-1059 (2013). MSC: 05C62 05C75 × Cite Format Result Cite Review PDF Full Text: DOI
Nagy, Béla; Totik, Vilmos Bernstein’s inequality for algebraic polynomials on circular arcs. (English) Zbl 1267.42001 Constr. Approx. 37, No. 2, 223-232 (2013). Reviewer: Yuri A. Farkov (Moskva) MSC: 42A05 41A17 × Cite Format Result Cite Review PDF Full Text: DOI Link
Duncan, Christian A.; Eppstein, David; Goodrich, Michael T.; Kobourov, Stephen G.; Nöllenburg, Martin Drawing trees with perfect angular resolution and polynomial area. (English) Zbl 1260.05036 Discrete Comput. Geom. 49, No. 2, 157-182 (2013). MSC: 05C05 05C62 × Cite Format Result Cite Review PDF Full Text: DOI