Paulson, Lawrence C. A formalised theorem in the partition calculus. (English) Zbl 07748742 Ann. Pure Appl. Logic 175, No. 1, Article ID 103246, 10 p. (2024). MSC: 03E02 03E10 03B35 68V15 68V20 PDFBibTeX XMLCite \textit{L. C. Paulson}, Ann. Pure Appl. Logic 175, No. 1, Article ID 103246, 10 p. (2024; Zbl 07748742) Full Text: DOI arXiv
Dall’Agnol, Marcel; Gur, Tom; Lachish, Oded A structural theorem for local algorithms with applications to coding, testing, and verification. (English) Zbl 07780708 SIAM J. Comput. 52, No. 6, 1413-1463 (2023). MSC: 68R01 68Q17 68W40 05C90 PDFBibTeX XMLCite \textit{M. Dall'Agnol} et al., SIAM J. Comput. 52, No. 6, 1413--1463 (2023; Zbl 07780708) Full Text: DOI arXiv
Chawin, Dror; Haviv, Ishay Improved NP-hardness of approximation for orthogonality dimension and minrank. (English) Zbl 1527.05060 SIAM J. Discrete Math. 37, No. 4, 2670-2688 (2023). MSC: 05C15 05C20 03D15 05C50 68Q25 PDFBibTeX XMLCite \textit{D. Chawin} and \textit{I. Haviv}, SIAM J. Discrete Math. 37, No. 4, 2670--2688 (2023; Zbl 1527.05060) Full Text: DOI arXiv
Keiler, Lucas; Gomes Costa Lima, Carlos Vinicius; Maia, Ana Karolinna; Sampaio, Rudini; Sau, Ignasi Target set selection with maximum activation time. (English) Zbl 1522.68409 Discrete Appl. Math. 338, 199-217 (2023). MSC: 68R10 05C10 05C75 68Q27 PDFBibTeX XMLCite \textit{L. Keiler} et al., Discrete Appl. Math. 338, 199--217 (2023; Zbl 1522.68409) Full Text: DOI arXiv
Gomes, Guilherme C. M.; Guedes, Matheus R.; dos Santos, Vinicius F. Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization. (English) Zbl 07704065 Algorithmica 85, No. 7, 1912-1947 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{G. C. M. Gomes} et al., Algorithmica 85, No. 7, 1912--1947 (2023; Zbl 07704065) Full Text: DOI
Koana, Tomohiro; Komusiewicz, Christian; Sommer, Frank Essentially tight kernels for (weakly) closed graphs. (English) Zbl 07691818 Algorithmica 85, No. 6, 1706-1735 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{T. Koana} et al., Algorithmica 85, No. 6, 1706--1735 (2023; Zbl 07691818) Full Text: DOI arXiv
Bickle, Allan Extremal decompositions for Nordhaus-Gaddum theorems. (English) Zbl 1514.05056 Discrete Math. 346, No. 7, Article ID 113392, 9 p. (2023). MSC: 05C15 05C78 05C70 68R10 PDFBibTeX XMLCite \textit{A. Bickle}, Discrete Math. 346, No. 7, Article ID 113392, 9 p. (2023; Zbl 1514.05056) Full Text: DOI
Adrar, Nabil; Jégou, Philippe; Terrioux, Cyril Computing partial hypergraphs of bounded width. (English) Zbl 1508.05122 Discrete Appl. Math. 329, 1-22 (2023). MSC: 05C65 05C85 68R10 PDFBibTeX XMLCite \textit{N. Adrar} et al., Discrete Appl. Math. 329, 1--22 (2023; Zbl 1508.05122) Full Text: DOI
Chen, Xiaodong; Guo, Xiyao; Yang, Xiwu 2-proper partition of a graph. (English) Zbl 07625284 Graphs Comb. 38, No. 6, Paper No. 191, 11 p. (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{X. Chen} et al., Graphs Comb. 38, No. 6, Paper No. 191, 11 p. (2022; Zbl 07625284) Full Text: DOI
Pudlák, Pavel; Rödl, Vojtěch Extractors for small zero-fixing sources. (English) Zbl 1513.68015 Combinatorica 42, No. 4, 587-616 (2022). Reviewer: Ioan Tomescu (Bucureşti) MSC: 68P30 05D10 68Q87 PDFBibTeX XMLCite \textit{P. Pudlák} and \textit{V. Rödl}, Combinatorica 42, No. 4, 587--616 (2022; Zbl 1513.68015) Full Text: DOI arXiv
Araújo, J.; Arraes, P. S. M. Hull and geodetic numbers for some classes of oriented graphs. (English) Zbl 1502.05081 Discrete Appl. Math. 323, 14-27 (2022). MSC: 05C20 05C10 05C38 05C12 68Q17 PDFBibTeX XMLCite \textit{J. Araújo} and \textit{P. S. M. Arraes}, Discrete Appl. Math. 323, 14--27 (2022; Zbl 1502.05081) Full Text: DOI
Araújo, Júlio; Bougeret, Marin; Campos, Victor; Sau, Ignasi Introducing lop-kernels: a framework for kernelization lower bounds. (English) Zbl 07608294 Algorithmica 84, No. 11, 3365-3406 (2022). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Araújo} et al., Algorithmica 84, No. 11, 3365--3406 (2022; Zbl 07608294) Full Text: DOI arXiv
Kaul, Hemanshu; Mudrock, Jeffrey A.; Wagstrom, Tim On the equitable choosability of the disjoint union of stars. (English) Zbl 07601292 Graphs Comb. 38, No. 5, Paper No. 163, 22 p. (2022). MSC: 68R10 05C15 PDFBibTeX XMLCite \textit{H. Kaul} et al., Graphs Comb. 38, No. 5, Paper No. 163, 22 p. (2022; Zbl 07601292) Full Text: DOI arXiv
Jackson, Marcel; Ren, Miaomiao; Zhao, Xianzhong Nonfinitely based ai-semirings with finitely based semigroup reducts. (English) Zbl 07594495 J. Algebra 611, 211-245 (2022). MSC: 16Y60 68Q17 PDFBibTeX XMLCite \textit{M. Jackson} et al., J. Algebra 611, 211--245 (2022; Zbl 07594495) Full Text: DOI arXiv
Džamonja, Mirna; Koutsoukou-Argyraki, Angeliki; Paulson, Lawrence C. Formalizing ordinal partition relations using Isabelle/HOL. (English) Zbl 1520.68217 Exp. Math. 31, No. 2, 383-400 (2022). Reviewer: Truong Hoang Le (Hà Nội) MSC: 68V20 03B35 03E02 03E05 PDFBibTeX XMLCite \textit{M. Džamonja} et al., Exp. Math. 31, No. 2, 383--400 (2022; Zbl 1520.68217) Full Text: DOI arXiv
Chattopadhyay, Arkadev; Mande, Nikhil S. A short list of equalities induces large sign-rank. (English) Zbl 1502.68124 SIAM J. Comput. 51, No. 3, 820-848 (2022). MSC: 68Q11 68Q06 68Q15 68Q17 PDFBibTeX XMLCite \textit{A. Chattopadhyay} and \textit{N. S. Mande}, SIAM J. Comput. 51, No. 3, 820--848 (2022; Zbl 1502.68124) Full Text: DOI
Chen, Lijie; Ren, Hanlin Strong average-case circuit lower bounds from nontrivial derandomization. (English) Zbl 07534654 SIAM J. Comput. 51, No. 3, STOC20-115-STOC20-173 (2022). MSC: 68Q05 68Q17 PDFBibTeX XMLCite \textit{L. Chen} and \textit{H. Ren}, SIAM J. Comput. 51, No. 3, STOC20--115-STOC20--173 (2022; Zbl 07534654) Full Text: DOI
Oliveira, Igor C.; Santhanam, Rahul; Tell, Roei Expander-based cryptography meets natural proofs. (English) Zbl 07506816 Comput. Complexity 31, No. 1, Paper No. 4, 60 p. (2022). MSC: 68Q06 94A60 PDFBibTeX XMLCite \textit{I. C. Oliveira} et al., Comput. Complexity 31, No. 1, Paper No. 4, 60 p. (2022; Zbl 07506816) Full Text: DOI
Belkhechine, Houmem Prime orientable graphs. (English) Zbl 1476.05164 Discrete Math. 345, No. 1, Article ID 112639, 8 p. (2022). MSC: 05C70 05C50 68R10 PDFBibTeX XMLCite \textit{H. Belkhechine}, Discrete Math. 345, No. 1, Article ID 112639, 8 p. (2022; Zbl 1476.05164) Full Text: DOI arXiv
Daneshpajouh, Hamid Reza; Meunier, Frédéric; Mizrahi, Guilhem Colorings of complements of line graphs. (English) Zbl 1522.05106 J. Graph Theory 98, No. 2, 216-233 (2021). MSC: 05C15 05C76 68Q17 PDFBibTeX XMLCite \textit{H. R. Daneshpajouh} et al., J. Graph Theory 98, No. 2, 216--233 (2021; Zbl 1522.05106) Full Text: DOI arXiv
Pach, János; Tardos, Gábor; Tóth, Géza Disjointness graphs of segments in the space. (English) Zbl 1510.05083 Comb. Probab. Comput. 30, No. 4, 498-512 (2021). MSC: 05C15 05C62 05C85 68Q17 PDFBibTeX XMLCite \textit{J. Pach} et al., Comb. Probab. Comput. 30, No. 4, 498--512 (2021; Zbl 1510.05083) Full Text: DOI
Paranhos, Raffael M.; Nascimento Silva, Janio Carlos; Souza, Uéverton S.; Ochi, Luiz Satoru Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes. (English) Zbl 07550536 Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 348-363 (2021). MSC: 68T20 90C27 PDFBibTeX XMLCite \textit{R. M. Paranhos} et al., Lect. Notes Comput. Sci. 13135, 348--363 (2021; Zbl 07550536) Full Text: DOI
Förster, Henry; Ganian, Robert; Klute, Fabian; Nöllenburg, Martin On strict (outer-)confluent graphs. (English) Zbl 1490.68152 J. Graph Algorithms Appl. 25, No. 1, 481-512 (2021). MSC: 68R10 05C62 05C69 05C85 PDFBibTeX XMLCite \textit{H. Förster} et al., J. Graph Algorithms Appl. 25, No. 1, 481--512 (2021; Zbl 1490.68152) Full Text: DOI
Babai, László; Hansen, Kristoffer A.; Podolskii, Vladimir V.; Sun, Xiaoming Weights of exact threshold functions. (English. Russian original) Zbl 1492.94224 Izv. Math. 85, No. 6, 1039-1059 (2021); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 85, No. 6, 5-26 (2021). MSC: 94C11 94D10 68Q15 PDFBibTeX XMLCite \textit{L. Babai} et al., Izv. Math. 85, No. 6, 1039--1059 (2021; Zbl 1492.94224); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 85, No. 6, 5--26 (2021) Full Text: DOI MNR
Long, Philip M. Superlinear integrality gaps for the minimum majority problem. (English) Zbl 07453660 SIAM J. Discrete Math. 35, No. 4, 3004-3016 (2021). MSC: 68W25 68Q17 68Q25 68T05 90C10 90C57 PDFBibTeX XMLCite \textit{P. M. Long}, SIAM J. Discrete Math. 35, No. 4, 3004--3016 (2021; Zbl 07453660) Full Text: DOI
Huynh, Tony; Reed, Bruce; Wood, David R.; Yepremyan, Liana Notes on tree- and path-chromatic number. (English) Zbl 1481.05048 Wood, David R. (ed.) et al., 2019–20 MATRIX annals. Cham: Springer. MATRIX Book Ser. 4, 489-498 (2021). MSC: 05C15 05C05 68R10 68Q25 PDFBibTeX XMLCite \textit{T. Huynh} et al., MATRIX Book Ser. 4, 489--498 (2021; Zbl 1481.05048) Full Text: DOI arXiv
Cooper, Martin C.; Herzig, Andreas; Maffre, Faustine; Maris, Frédéric; Perrotin, Elise; Régnier, Pierre A lightweight epistemic logic and its application to planning. (English) Zbl 1520.68184 Artif. Intell. 298, Article ID 103437, 32 p. (2021). MSC: 68T27 03B42 68Q17 68T20 PDFBibTeX XMLCite \textit{M. C. Cooper} et al., Artif. Intell. 298, Article ID 103437, 32 p. (2021; Zbl 1520.68184) Full Text: DOI HAL
Bun, Mark; Thaler, Justin The large-error approximate degree of \(\mathrm{AC}^0\). (English) Zbl 1528.68135 Theory Comput. 17, Paper No. 7, 46 p. (2021). MSC: 68Q15 68Q06 68Q17 PDFBibTeX XMLCite \textit{M. Bun} and \textit{J. Thaler}, Theory Comput. 17, Paper No. 7, 46 p. (2021; Zbl 1528.68135) Full Text: DOI
Williams, R. Ryan From circuit complexity to faster all-pairs shortest paths. (English) Zbl 1470.05139 SIAM Rev. 63, No. 3, 559-582 (2021). MSC: 05C76 05C82 05C85 68Q25 94C05 68W25 PDFBibTeX XMLCite \textit{R. R. Williams}, SIAM Rev. 63, No. 3, 559--582 (2021; Zbl 1470.05139) Full Text: DOI
Bulteau, Laurent; Grüttemeier, Niels; Komusiewicz, Christian; Sorge, Manuel Your rugby mates don’t need to know your colleagues: triadic closure with edge colors. (English) Zbl 1477.68210 J. Comput. Syst. Sci. 120, 75-96 (2021). MSC: 68R10 05C15 68Q17 68Q27 68W40 91D30 PDFBibTeX XMLCite \textit{L. Bulteau} et al., J. Comput. Syst. Sci. 120, 75--96 (2021; Zbl 1477.68210) Full Text: DOI HAL
Fomin, Fedor V.; Golovach, Petr A. Subexponential parameterized algorithms and kernelization on almost chordal graphs. (English) Zbl 1467.05254 Algorithmica 83, No. 7, 2170-2214 (2021). MSC: 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{P. A. Golovach}, Algorithmica 83, No. 7, 2170--2214 (2021; Zbl 1467.05254) Full Text: DOI arXiv
Zhang, Huaqiang; Zhang, Xin Theoretical aspects of equitable partition of networks into sparse modules. (English) Zbl 1482.05322 Theor. Comput. Sci. 871, 51-61 (2021). MSC: 05C82 05C15 68R10 05C10 PDFBibTeX XMLCite \textit{H. Zhang} and \textit{X. Zhang}, Theor. Comput. Sci. 871, 51--61 (2021; Zbl 1482.05322) Full Text: DOI
Chiarelli, Nina; Martínez-Barona, Berenice; Milanič, Martin; Monnot, Jérôme; Muršič, Peter Strong cliques in diamond-free graphs. (English) Zbl 1458.05189 Theor. Comput. Sci. 858, 49-63 (2021). MSC: 05C69 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{N. Chiarelli} et al., Theor. Comput. Sci. 858, 49--63 (2021; Zbl 1458.05189) Full Text: DOI arXiv
Uchizawa, Kei Size, depth and energy of threshold circuits computing parity function. (English) Zbl 07765412 Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 54, 13 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{K. Uchizawa}, LIPIcs -- Leibniz Int. Proc. Inform. 181, Article 54, 13 p. (2020; Zbl 07765412) Full Text: DOI
Bradshaw, Peter; Masařík, Tomáš; Stacho, Ladislav Flexible list colorings in graphs with special degeneracy conditions. (English) Zbl 07765389 Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 31, 15 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{P. Bradshaw} et al., LIPIcs -- Leibniz Int. Proc. Inform. 181, Article 31, 15 p. (2020; Zbl 07765389) Full Text: DOI
Bonnet, Édouard; Thomassé, Stéphan; Tran, Xuan Thang; Watrigant, Rémi An algorithmic weakening of the Erdő’s-Hajnal conjecture. (English) Zbl 07651162 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 23, 18 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{É. Bonnet} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 23, 18 p. (2020; Zbl 07651162) Full Text: DOI arXiv
Wu, Yaokun; Zhu, Yinfeng Weighted rooted trees: fat or tall? (English) Zbl 07603938 Fernau, Henning, Computer science – theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12159, 406-418 (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{Y. Wu} and \textit{Y. Zhu}, Lect. Notes Comput. Sci. 12159, 406--418 (2020; Zbl 07603938) Full Text: DOI
Ben-Eliezer, Omri; Gishboliner, Lior; Hefetz, Dan; Krivelevich, Michael Very fast construction of bounded-degree spanning graphs via the semi-random graph process. (English) Zbl 1497.68365 Random Struct. Algorithms 57, No. 4, 892-919 (2020). MSC: 68R10 05C80 60C05 PDFBibTeX XMLCite \textit{O. Ben-Eliezer} et al., Random Struct. Algorithms 57, No. 4, 892--919 (2020; Zbl 1497.68365) Full Text: DOI
van Ditmarsch, Hans; van der Hoek, Wiebe; Kuijer, Louwe B. The logic of gossiping. (English) Zbl 1493.68346 Artif. Intell. 286, Article ID 103306, 26 p. (2020). MSC: 68T27 03B42 68Q60 PDFBibTeX XMLCite \textit{H. van Ditmarsch} et al., Artif. Intell. 286, Article ID 103306, 26 p. (2020; Zbl 1493.68346) Full Text: DOI HAL
Chee, Yeow Meng; Colbourn, Charles J.; Dau, Hoang; Gabrys, Ryan; Ling, Alan C. H.; Lusi, Dylan; Milenkovic, Olgica Access balancing in storage systems by labeling partial Steiner systems. (English) Zbl 1457.05014 Des. Codes Cryptography 88, No. 11, 2361-2376 (2020). MSC: 05B07 05B40 94B60 68P20 PDFBibTeX XMLCite \textit{Y. M. Chee} et al., Des. Codes Cryptography 88, No. 11, 2361--2376 (2020; Zbl 1457.05014) Full Text: DOI arXiv
Dzindzalieta, D.; Götze, F. Half-spaces with influential variable. (English) Zbl 1434.68196 Theory Probab. Appl. 65, No. 1, 114-120 (2020) and Teor. Veroyatn. Primen. 65, No. 1, 142-150 (2020). MSC: 68Q25 06E30 60E15 68W20 PDFBibTeX XMLCite \textit{D. Dzindzalieta} and \textit{F. Götze}, Theory Probab. Appl. 65, No. 1, 114--120 (2020; Zbl 1434.68196) Full Text: DOI
Edwards, Keith; Rzążewski, Paweł Complete colourings of hypergraphs. (English) Zbl 1429.05065 Discrete Math. 343, No. 2, Article ID 111673, 12 p. (2020). MSC: 05C15 05C65 68Q25 PDFBibTeX XMLCite \textit{K. Edwards} and \textit{P. Rzążewski}, Discrete Math. 343, No. 2, Article ID 111673, 12 p. (2020; Zbl 1429.05065) Full Text: DOI Link
Golovnev, Alexander; Göös, Mika; Reichman, Daniel; Shinkar, Igor String matching: communication, circuits, and learning. (English) Zbl 07650123 Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 56, 20 p. (2019). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{A. Golovnev} et al., LIPIcs -- Leibniz Int. Proc. Inform. 145, Article 56, 20 p. (2019; Zbl 07650123) Full Text: DOI arXiv
Chen, Lijie; Williams, R. Ryan Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity. (English) Zbl 07564419 Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 19, 43 p. (2019). MSC: 68Q25 PDFBibTeX XMLCite \textit{L. Chen} and \textit{R. R. Williams}, LIPIcs -- Leibniz Int. Proc. Inform. 137, Article 19, 43 p. (2019; Zbl 07564419) Full Text: DOI
Carboni, Oliveira Igor; Santhanam, Rahul; Tell, Roei Expander-based cryptography meets natural proofs. (English) Zbl 07559061 Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 18, 14 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{O. I. Carboni} et al., LIPIcs -- Leibniz Int. Proc. Inform. 124, Article 18, 14 p. (2019; Zbl 07559061) Full Text: DOI
Chaplick, Steven; Klute, Fabian; Parada, Irene; Rollin, Jonathan; Ueckerdt, Torsten Edge-minimum saturated \(k\)-planar drawings. (English) Zbl 07551730 Purchase, Helen C. (ed.) et al., Graph drawing and network visualization. 29th international symposium, GD 2021, Tübingen, Germany, September 14–17, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12868, 3-17 (2021). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Lect. Notes Comput. Sci. 12868, 3--17 (2019; Zbl 07551730) Full Text: DOI arXiv
Ravi, R.; Rudenko, Oleksandr Multicommodity multicast, wireless and fast. (English) Zbl 07525515 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 78, 20 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{R. Ravi} and \textit{O. Rudenko}, LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 78, 20 p. (2019; Zbl 07525515) Full Text: DOI
Pach, János; Tomon, István Coloring Hasse diagrams and disjointness graphs of curves. (English) Zbl 07266120 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 244-250 (2019). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{J. Pach} and \textit{I. Tomon}, Lect. Notes Comput. Sci. 11904, 244--250 (2019; Zbl 07266120) Full Text: DOI arXiv
Amano, Kazuyuki; Tate, Shoma On XOR lemmas for the weight of polynomial threshold functions. (English) Zbl 1435.68220 Inf. Comput. 269, Article ID 104439, 11 p. (2019). MSC: 68R05 06E30 68Q25 90C10 94D10 PDFBibTeX XMLCite \textit{K. Amano} and \textit{S. Tate}, Inf. Comput. 269, Article ID 104439, 11 p. (2019; Zbl 1435.68220) Full Text: DOI
Sakai, Takayuki; Seto, Kazuhisa; Tamaki, Suguru; Teruyama, Junichi Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression. (English) Zbl 1423.68218 J. Comput. Syst. Sci. 105, 87-103 (2019). MSC: 68Q25 68Q17 94C10 PDFBibTeX XMLCite \textit{T. Sakai} et al., J. Comput. Syst. Sci. 105, 87--103 (2019; Zbl 1423.68218) Full Text: DOI Link
van Ditmarsch, Hans; van Eijck, Jan; Pardo, Pere; Ramezanian, Rahim; Schwarzentruber, François Dynamic gossip. (English) Zbl 1421.68004 Bull. Iran. Math. Soc. 45, No. 3, 701-728 (2019). MSC: 68M12 68M14 68R10 PDFBibTeX XMLCite \textit{H. van Ditmarsch} et al., Bull. Iran. Math. Soc. 45, No. 3, 701--728 (2019; Zbl 1421.68004) Full Text: DOI arXiv
Chen, Shiteng; Papakonstantinou, Periklis A. Depth reduction for composites. (English) Zbl 1421.68054 SIAM J. Comput. 48, No. 2, 668-686 (2019). MSC: 68Q15 68Q17 94C10 PDFBibTeX XMLCite \textit{S. Chen} and \textit{P. A. Papakonstantinou}, SIAM J. Comput. 48, No. 2, 668--686 (2019; Zbl 1421.68054) Full Text: DOI
Halldórsson, Magnús M.; Köhler, Sven; Rawitz, Dror Distributed approximation of \(k\)-service assignment. (English) Zbl 1451.68347 Distrib. Comput. 32, No. 1, 27-40 (2019). MSC: 68W15 68M10 68W25 91B68 PDFBibTeX XMLCite \textit{M. M. Halldórsson} et al., Distrib. Comput. 32, No. 1, 27--40 (2019; Zbl 1451.68347) Full Text: DOI
Csaba, Béla; Nagy-György, Judit Embedding graphs having Ore-degree at most five. (English) Zbl 1409.05113 SIAM J. Discrete Math. 33, No. 1, 474-508 (2019). Reviewer: Zhizhang Shen (Plymouth) MSC: 05C35 05C75 05C07 68R10 PDFBibTeX XMLCite \textit{B. Csaba} and \textit{J. Nagy-György}, SIAM J. Discrete Math. 33, No. 1, 474--508 (2019; Zbl 1409.05113) Full Text: DOI arXiv
Cooper, Martin C.; Herzig, Andreas; Maffre, Faustine; Maris, Frédéric; Régnier, Pierre The epistemic gossip problem. (English) Zbl 1486.68189 Discrete Math. 342, No. 3, 654-663 (2019). MSC: 68T42 03B42 68M12 68R10 PDFBibTeX XMLCite \textit{M. C. Cooper} et al., Discrete Math. 342, No. 3, 654--663 (2019; Zbl 1486.68189) Full Text: DOI Link
Bun, Mark; Thaler, Justin Approximate degree and the complexity of depth three circuits. (English) Zbl 1522.68195 Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 35, 18 p. (2018). MSC: 68Q06 PDFBibTeX XMLCite \textit{M. Bun} and \textit{J. Thaler}, LIPIcs -- Leibniz Int. Proc. Inform. 116, Article 35, 18 p. (2018; Zbl 1522.68195) Full Text: DOI
Williams, R. Ryan Faster all-pairs shortest paths via circuit complexity. (English) Zbl 1400.05075 SIAM J. Comput. 47, No. 5, 1965-1985 (2018). MSC: 05C12 05C38 05C20 05C76 05C85 68Q25 PDFBibTeX XMLCite \textit{R. R. Williams}, SIAM J. Comput. 47, No. 5, 1965--1985 (2018; Zbl 1400.05075) Full Text: DOI
Cao, Yixin; Ke, Yuping; Otachi, Yota; You, Jie Vertex deletion problems on chordal graphs. (English) Zbl 1401.68114 Theor. Comput. Sci. 745, 75-86 (2018). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{Y. Cao} et al., Theor. Comput. Sci. 745, 75--86 (2018; Zbl 1401.68114) Full Text: DOI arXiv Link
Cheraghchi, Mahdi; Grigorescu, Elena; Juba, Brendan; Wimmer, Karl; Xie, Ning \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product. (English) Zbl 1398.68159 J. Comput. Syst. Sci. 97, 45-59 (2018). MSC: 68Q05 68Q17 94C10 PDFBibTeX XMLCite \textit{M. Cheraghchi} et al., J. Comput. Syst. Sci. 97, 45--59 (2018; Zbl 1398.68159) Full Text: DOI
Ham, Lucy; Jackson, Marcel Axiomatisability and hardness for universal Horn classes of hypergraphs. (English) Zbl 1522.08003 Algebra Univers. 79, No. 2, Paper No. 30, 17 p. (2018). MSC: 08C15 05C65 05C60 68Q17 03C13 PDFBibTeX XMLCite \textit{L. Ham} and \textit{M. Jackson}, Algebra Univers. 79, No. 2, Paper No. 30, 17 p. (2018; Zbl 1522.08003) Full Text: DOI arXiv
Fenner, Peter; Johnson, Marianne; Kambites, Mark NP-completeness in the gossip monoid. (English) Zbl 1498.20137 Int. J. Algebra Comput. 28, No. 4, 653-672 (2018). MSC: 20M05 68Q17 PDFBibTeX XMLCite \textit{P. Fenner} et al., Int. J. Algebra Comput. 28, No. 4, 653--672 (2018; Zbl 1498.20137) Full Text: DOI arXiv
Jahanjou, Hamidreza; Miles, Eric; Viola, Emanuele Local reduction. (English) Zbl 1394.68184 Inf. Comput. 261, Part 2, 281-295 (2018). MSC: 68Q25 68Q15 PDFBibTeX XMLCite \textit{H. Jahanjou} et al., Inf. Comput. 261, Part 2, 281--295 (2018; Zbl 1394.68184) Full Text: DOI
Kawachi, Akinori Circuit lower bounds from learning-theoretic approaches. (English) Zbl 1393.68152 Theor. Comput. Sci. 733, 83-98 (2018). MSC: 68T05 68Q17 94C10 PDFBibTeX XMLCite \textit{A. Kawachi}, Theor. Comput. Sci. 733, 83--98 (2018; Zbl 1393.68152) Full Text: DOI
Furmańczyk, Hanna; Kubale, Marek Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs. (English) Zbl 1380.05062 Discrete Appl. Math. 237, 116-122 (2018). MSC: 05C15 68Q25 PDFBibTeX XMLCite \textit{H. Furmańczyk} and \textit{M. Kubale}, Discrete Appl. Math. 237, 116--122 (2018; Zbl 1380.05062) Full Text: DOI arXiv
Araújo, Rafael T.; Sampaio, Rudini M.; dos Santos, Vinícius F.; Szwarcfiter, Jayme L. The convexity of induced paths of order three and applications: complexity aspects. (English) Zbl 1380.05031 Discrete Appl. Math. 237, 33-42 (2018). MSC: 05C10 05C42 68Q25 PDFBibTeX XMLCite \textit{R. T. Araújo} et al., Discrete Appl. Math. 237, 33--42 (2018; Zbl 1380.05031) Full Text: DOI
Sivaraman, Vaidy Some problems on induced subgraphs. (English) Zbl 1377.05071 Discrete Appl. Math. 236, 422-427 (2018). MSC: 05C15 68Q25 PDFBibTeX XMLCite \textit{V. Sivaraman}, Discrete Appl. Math. 236, 422--427 (2018; Zbl 1377.05071) Full Text: DOI arXiv
Marcilon, Thiago; Sampaio, Rudini The maximum time of 2-neighbor bootstrap percolation: complexity results. (English) Zbl 1383.05299 Theor. Comput. Sci. 708, 1-17 (2018). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Marcilon} and \textit{R. Sampaio}, Theor. Comput. Sci. 708, 1--17 (2018; Zbl 1383.05299) Full Text: DOI arXiv
Li, Zepeng; Zhu, Enqiang; Shao, Zehui; Xu, Jin NP-completeness of local colorings of graphs. (English) Zbl 1419.68055 Inf. Process. Lett. 130, 25-29 (2018). MSC: 68Q17 05C15 PDFBibTeX XMLCite \textit{Z. Li} et al., Inf. Process. Lett. 130, 25--29 (2018; Zbl 1419.68055) Full Text: DOI
Dourado, Mitre C.; da Silva, Aline R. Inapproximability results and bounds for the Helly and Radon numbers of a graph. (English) Zbl 1372.05051 Discrete Appl. Math. 232, 134-141 (2017). MSC: 05C10 05C85 68W25 52A35 PDFBibTeX XMLCite \textit{M. C. Dourado} and \textit{A. R. da Silva}, Discrete Appl. Math. 232, 134--141 (2017; Zbl 1372.05051) Full Text: DOI
Zeume, Thomas The dynamic descriptive complexity of \(k\)-clique. (English) Zbl 1376.68055 Inf. Comput. 256, 9-22 (2017). MSC: 68Q19 05C69 PDFBibTeX XMLCite \textit{T. Zeume}, Inf. Comput. 256, 9--22 (2017; Zbl 1376.68055) Full Text: DOI arXiv
Şeker, Oylum; Heggernes, Pinar; Ekim, Tınaz; Taşkın, Z. Caner Linear-time generation of random chordal graphs. (English) Zbl 1486.68138 Fotakis, Dimitris (ed.) et al., Algorithms and complexity. 10th international conference, CIAC 2017, Athens, Greece, May 24–26, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10236, 442-453 (2017). MSC: 68R10 05C80 05C85 68W05 68W40 PDFBibTeX XMLCite \textit{O. Şeker} et al., Lect. Notes Comput. Sci. 10236, 442--453 (2017; Zbl 1486.68138) Full Text: DOI
Ding, Ning; Ren, Yanli; Gu, Dawu Learning \(\mathrm{AC}^0\) under \(k\)-dependent distributions. (English) Zbl 1485.68121 Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 14th annual conference, TAMC 2017, Bern, Switzerland, April 20–22, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10185, 187-200 (2017). MSC: 68Q32 68Q25 PDFBibTeX XMLCite \textit{N. Ding} et al., Lect. Notes Comput. Sci. 10185, 187--200 (2017; Zbl 1485.68121) Full Text: DOI
Harutyunyan, Hovhannes A.; Kamali, Shahin Efficient broadcast trees for weighted vertices. (English) Zbl 1358.05279 Discrete Appl. Math. 216, Part 3, 598-608 (2017). MSC: 05C85 05C82 68M10 PDFBibTeX XMLCite \textit{H. A. Harutyunyan} and \textit{S. Kamali}, Discrete Appl. Math. 216, Part 3, 598--608 (2017; Zbl 1358.05279) Full Text: DOI
Malyshev, D. S.; Lobanova, O. O. Two complexity results for the vertex coloring problem. (English) Zbl 1440.05093 Discrete Appl. Math. 219, 158-166 (2017). MSC: 05C15 05C22 68Q17 05C85 PDFBibTeX XMLCite \textit{D. S. Malyshev} and \textit{O. O. Lobanova}, Discrete Appl. Math. 219, 158--166 (2017; Zbl 1440.05093) Full Text: DOI
Apt, Krzysztof R.; Grossi, Davide; van der Hoek, Wiebe Epistemic protocols for distributed gossiping. (English) Zbl 1483.68361 Ramanujam, R. (ed.), Proceedings of the fifteenth conference on theoretical aspects of rationality and knowledge, TARK 2015, Carnegie Mellon University, Pittsburgh, USA, June 4–6, 2015. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 215, 51-66 (2016). MSC: 68T27 03B42 68R10 PDFBibTeX XMLCite \textit{K. R. Apt} et al., Electron. Proc. Theor. Comput. Sci. (EPTCS) 215, 51--66 (2016; Zbl 1483.68361) Full Text: arXiv Link
Chuzhoy, Julia Routing in undirected graphs with constant congestion. (English) Zbl 1350.68207 SIAM J. Comput. 45, No. 4, 1490-1532 (2016). MSC: 68R10 05C21 05C85 68W20 68W25 PDFBibTeX XMLCite \textit{J. Chuzhoy}, SIAM J. Comput. 45, No. 4, 1490--1532 (2016; Zbl 1350.68207) Full Text: DOI Link
Duraj, Lech; Gutowski, Grzegorz; Kozik, Jakub Chip games and paintability. (English) Zbl 1339.05129 Electron. J. Comb. 23, No. 3, Research Paper P3.3, 12 p. (2016). MSC: 05C15 68W27 PDFBibTeX XMLCite \textit{L. Duraj} et al., Electron. J. Comb. 23, No. 3, Research Paper P3.3, 12 p. (2016; Zbl 1339.05129) Full Text: arXiv Link
Cao, Yixin; Marx, Dániel Chordal editing is fixed-parameter tractable. (English) Zbl 1344.68095 Algorithmica 75, No. 1, 118-137 (2016). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{Y. Cao} and \textit{D. Marx}, Algorithmica 75, No. 1, 118--137 (2016; Zbl 1344.68095) Full Text: DOI arXiv Link
Finocchi, Irene; Finocchi, Marco; Fusco, Emanuele G. Clique counting in MapReduce: algorithms and experiments. (English) Zbl 1347.68284 ACM J. Exp. Algorithm. 20, Article No. 1.7, 20 p. (2015). MSC: 68R10 05C30 05C69 05C82 05C85 68Q25 68W10 PDFBibTeX XMLCite \textit{I. Finocchi} et al., ACM J. Exp. Algorithm. 20, Article No. 1.7, 20 p. (2015; Zbl 1347.68284) Full Text: DOI arXiv
Jahanjou, Hamid; Miles, Eric; Viola, Emanuele Local reductions. (English) Zbl 1394.68183 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer (ISBN 978-3-662-47671-0/pbk; 978-3-662-47672-7/ebook). Lecture Notes in Computer Science 9134, 749-760 (2015). MSC: 68Q25 68Q15 PDFBibTeX XMLCite \textit{H. Jahanjou} et al., Lect. Notes Comput. Sci. 9134, 749--760 (2015; Zbl 1394.68183) Full Text: DOI arXiv
Coelho, Erika M. M.; Dourado, Mitre C.; Sampaio, Rudini M. Inapproximability results for graph convexity parameters. (English) Zbl 1329.68122 Theor. Comput. Sci. 600, 49-58 (2015). MSC: 68Q17 05C12 05C62 05C85 PDFBibTeX XMLCite \textit{E. M. M. Coelho} et al., Theor. Comput. Sci. 600, 49--58 (2015; Zbl 1329.68122) Full Text: DOI
Aravind, N. R.; Kalyanasundaram, Subrahmanyam; Sandeep, R. B.; Sivadasan, Naveen The chromatic discrepancy of graphs. (English) Zbl 1311.05057 Discrete Appl. Math. 184, 40-49 (2015). MSC: 05C15 05C80 68Q17 PDFBibTeX XMLCite \textit{N. R. Aravind} et al., Discrete Appl. Math. 184, 40--49 (2015; Zbl 1311.05057) Full Text: DOI arXiv
Hartmann, Sven; Köhler, Henning; Leck, Uwe; Link, Sebastian; Thalheim, Bernhard; Wang, Jing Constructing Armstrong tables for general cardinality constraints and not-null constraints. (English) Zbl 1319.68072 Ann. Math. Artif. Intell. 73, No. 1-2, 139-165 (2015). MSC: 68P15 PDFBibTeX XMLCite \textit{S. Hartmann} et al., Ann. Math. Artif. Intell. 73, No. 1--2, 139--165 (2015; Zbl 1319.68072) Full Text: DOI
Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V. Polynomial threshold functions and Boolean threshold circuits. (English) Zbl 1312.68089 Inf. Comput. 240, 56-73 (2015). MSC: 68Q15 94C10 PDFBibTeX XMLCite \textit{K. A. Hansen} and \textit{V. V. Podolskii}, Inf. Comput. 240, 56--73 (2015; Zbl 1312.68089) Full Text: DOI
Shabanov, Dmitry A. Equitable two-colorings of uniform hypergraphs. (English) Zbl 1301.05244 Eur. J. Comb. 43, 185-203 (2015). MSC: 05C65 05C15 05C85 68W10 PDFBibTeX XMLCite \textit{D. A. Shabanov}, Eur. J. Comb. 43, 185--203 (2015; Zbl 1301.05244) Full Text: DOI
Marcilon, Thiago; Nascimento, Samuel; Sampaio, Rudini The maximum time of 2-neighbour bootstrap percolation: complexity results. (English) Zbl 1417.05224 Kratsch, Dieter (ed.) et al., Graph-theoretic concepts in computer science. 40th international workshop, WG 2014, Nouan-le-Fuzelier, France, June 25–27, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8747, 372-383 (2014). MSC: 05C85 68Q25 60K35 PDFBibTeX XMLCite \textit{T. Marcilon} et al., Lect. Notes Comput. Sci. 8747, 372--383 (2014; Zbl 1417.05224) Full Text: DOI
Dodos, Pandelis; Kanellopoulos, Vassilis; Tyros, Konstantinos A density version of the Carlson-Simpson theorem. (English) Zbl 1304.05001 J. Eur. Math. Soc. (JEMS) 16, No. 10, 2097-2164 (2014). Reviewer: Igor Vladimirov Protasov (Kyiv) MSC: 05A05 05D10 68R15 PDFBibTeX XMLCite \textit{P. Dodos} et al., J. Eur. Math. Soc. (JEMS) 16, No. 10, 2097--2164 (2014; Zbl 1304.05001) Full Text: DOI arXiv
Bekos, M. A.; Kaufmann, M.; Kobourov, S.; Veeramoni, S. A note on maximum differential coloring of planar graphs. (English) Zbl 1309.05066 J. Discrete Algorithms 29, 1-7 (2014). MSC: 05C15 05C10 05C78 68Q17 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., J. Discrete Algorithms 29, 1--7 (2014; Zbl 1309.05066) Full Text: DOI
Zhang, Zan-Bo; Zhang, Xiaoyan Triangle strings: structures for augmentation of vertex-disjoint triangle sets. (English) Zbl 1296.68106 Inf. Process. Lett. 114, No. 8, 450-456 (2014). MSC: 68R05 68R15 PDFBibTeX XMLCite \textit{Z.-B. Zhang} and \textit{X. Zhang}, Inf. Process. Lett. 114, No. 8, 450--456 (2014; Zbl 1296.68106) Full Text: DOI
Kloks, Ton; Poon, Sheung-Hung; Tsai, Feng-Ren; Wang, Yue-Li On the complexity of the black-and-white coloring problem on some classes of perfect graphs. (English) Zbl 1418.68104 Theor. Comput. Sci. 532, 51-63 (2014). MSC: 68Q25 05C15 05C62 68Q17 PDFBibTeX XMLCite \textit{T. Kloks} et al., Theor. Comput. Sci. 532, 51--63 (2014; Zbl 1418.68104) Full Text: DOI
Kahrs, Stefan Infinitary rewriting: closure operators, equivalences and models. (English) Zbl 1294.68098 Acta Inf. 50, No. 2, 123-156 (2013). Reviewer: Magnus Steinby (Turku) MSC: 68Q42 54E35 08A70 PDFBibTeX XMLCite \textit{S. Kahrs}, Acta Inf. 50, No. 2, 123--156 (2013; Zbl 1294.68098) Full Text: DOI
Gál, Anna; Trifonov, Vladimir On the correlation between parity and modular polynomials. (English) Zbl 1279.68098 Theory Comput. Syst. 50, No. 3, 516-536 (2012). MSC: 68Q15 68Q25 PDFBibTeX XMLCite \textit{A. Gál} and \textit{V. Trifonov}, Theory Comput. Syst. 50, No. 3, 516--536 (2012; Zbl 1279.68098) Full Text: DOI
Jeřábek, Emil Root finding with threshold circuits. (English) Zbl 1282.68116 Theor. Comput. Sci. 462, 59-69 (2012). MSC: 68Q15 68Q10 PDFBibTeX XMLCite \textit{E. Jeřábek}, Theor. Comput. Sci. 462, 59--69 (2012; Zbl 1282.68116) Full Text: DOI arXiv
Pagh, Rasmus; Tsourakakis, Charalampos E. Colorful triangle counting and a MapReduce implementation. (English) Zbl 1237.68245 Inf. Process. Lett. 112, No. 7, 277-281 (2012). MSC: 68W20 05C15 05C85 PDFBibTeX XMLCite \textit{R. Pagh} and \textit{C. E. Tsourakakis}, Inf. Process. Lett. 112, No. 7, 277--281 (2012; Zbl 1237.68245) Full Text: DOI
Podolskii, Vladimir V. Exponential lower bound for bounded depth circuits with few threshold gates. (English) Zbl 1237.68091 Inf. Process. Lett. 112, No. 7, 267-271 (2012). MSC: 68Q17 68Q15 PDFBibTeX XMLCite \textit{V. V. Podolskii}, Inf. Process. Lett. 112, No. 7, 267--271 (2012; Zbl 1237.68091) Full Text: DOI
Kotrbčík, Michal A note on disjoint cycles. (English) Zbl 1253.68156 Inf. Process. Lett. 112, No. 4, 135-137 (2012). MSC: 68Q17 05C38 PDFBibTeX XMLCite \textit{M. Kotrbčík}, Inf. Process. Lett. 112, No. 4, 135--137 (2012; Zbl 1253.68156) Full Text: DOI
Podolskii, Vladimir V. Degree-uniform lower bound on the weights of polynomials with given sign function. (English. Russian original) Zbl 1358.94116 Proc. Steklov Inst. Math. 274, 231-246 (2011); translation from Tr. Mat. Inst. Steklova 274, 252-268 (2011). MSC: 94C10 68Q17 PDFBibTeX XMLCite \textit{V. V. Podolskii}, Proc. Steklov Inst. Math. 274, 231--246 (2011; Zbl 1358.94116); translation from Tr. Mat. Inst. Steklova 274, 252--268 (2011) Full Text: DOI
Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung Complexity of hard-core set proofs. (English) Zbl 1255.68067 Comput. Complexity 20, No. 1, 145-171 (2011). MSC: 68Q05 68Q17 68Q10 PDFBibTeX XMLCite \textit{C.-J. Lu} et al., Comput. Complexity 20, No. 1, 145--171 (2011; Zbl 1255.68067) Full Text: DOI
Sherstov, Alexander A. The unbounded-error communication complexity of symmetric functions. (English) Zbl 1265.03035 Combinatorica 31, No. 5, 583-614 (2011). Reviewer: Cristian S. Calude (Bucuresti) MSC: 03D15 68Q17 PDFBibTeX XMLCite \textit{A. A. Sherstov}, Combinatorica 31, No. 5, 583--614 (2011; Zbl 1265.03035) Full Text: DOI
Bonomo, Flavia; Mattia, Sara; Oriolo, Gianpaolo Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. (English) Zbl 1230.90030 Theor. Comput. Sci. 412, No. 45, 6261-6268 (2011). MSC: 90B06 90C35 05C15 68Q25 PDFBibTeX XMLCite \textit{F. Bonomo} et al., Theor. Comput. Sci. 412, No. 45, 6261--6268 (2011; Zbl 1230.90030) Full Text: DOI