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
Schweser, Thomas DP-degree colorable hypergraphs. (English) Zbl 1448.05077 Theor. Comput. Sci. 796, 196-206 (2019). Reviewer: Eckhard Steffen (Paderborn) MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{T. Schweser}, Theor. Comput. Sci. 796, 196--206 (2019; Zbl 1448.05077) Full Text: DOI arXiv
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
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
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
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel Graphs of edge-intersecting and non-splitting paths. (English) Zbl 1339.05410 Theor. Comput. Sci. 629, 40-50 (2016). MSC: 05C99 PDFBibTeX XMLCite \textit{A. Boyacı} et al., Theor. Comput. Sci. 629, 40--50 (2016; Zbl 1339.05410) Full Text: DOI
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
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
Dourado, Mitre C.; Rautenbach, Dieter; dos Santos, Vinícius Fernandes; Schäfer, Philipp M.; Szwarcfiter, Jayme L. On the Carathéodory number of interval and graph convexities. (English) Zbl 1419.05143 Theor. Comput. Sci. 510, 127-135 (2013). MSC: 05C62 52A37 PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Theor. Comput. Sci. 510, 127--135 (2013; Zbl 1419.05143) Full Text: DOI
Nakprasit, Keaitsuda; Nakprasit, Kittikorn Equitable colorings of planar graphs without short cycles. (English) Zbl 1253.05072 Theor. Comput. Sci. 465, 21-27 (2012). MSC: 05C15 05C10 05C38 PDFBibTeX XMLCite \textit{K. Nakprasit} and \textit{K. Nakprasit}, Theor. Comput. Sci. 465, 21--27 (2012; Zbl 1253.05072) Full Text: DOI arXiv
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
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
Zhu, Junlei; Bu, Yuehua Equitable and equitable list colorings of graphs. (English) Zbl 1198.05074 Theor. Comput. Sci. 411, No. 43, 3873-3876 (2010). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Zhu} and \textit{Y. Bu}, Theor. Comput. Sci. 411, No. 43, 3873--3876 (2010; Zbl 1198.05074) Full Text: DOI
Uchizawa, Kei; Takimoto, Eiji Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity. (English) Zbl 1152.68047 Theor. Comput. Sci. 407, No. 1-3, 474-487 (2008). MSC: 68T05 68Q17 92B20 94C10 PDFBibTeX XMLCite \textit{K. Uchizawa} and \textit{E. Takimoto}, Theor. Comput. Sci. 407, No. 1--3, 474--487 (2008; Zbl 1152.68047) Full Text: DOI
Zhu, Junlei; Bu, Yuehua Equitable list colorings of planar graphs without short cycles. (English) Zbl 1152.05027 Theor. Comput. Sci. 407, No. 1-3, 21-28 (2008). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Zhu} and \textit{Y. Bu}, Theor. Comput. Sci. 407, No. 1--3, 21--28 (2008; Zbl 1152.05027) Full Text: DOI
Atıcı, Alp; Servedio, Rocco A. Learning unions of \(\omega(1)\)-dimensional rectangles. (English) Zbl 1181.68159 Theor. Comput. Sci. 405, No. 3, 209-222 (2008). MSC: 68Q32 PDFBibTeX XMLCite \textit{A. Atıcı} and \textit{R. A. Servedio}, Theor. Comput. Sci. 405, No. 3, 209--222 (2008; Zbl 1181.68159) Full Text: DOI
Kostochka, A. V.; Nakprasit, K. On equitable \(\Delta\)-coloring of graphs with low average degree. (English) Zbl 1086.05030 Theor. Comput. Sci. 349, No. 1, 82-91 (2005). Reviewer: Ko-Wei Lih (Nankang) MSC: 05C15 PDFBibTeX XMLCite \textit{A. V. Kostochka} and \textit{K. Nakprasit}, Theor. Comput. Sci. 349, No. 1, 82--91 (2005; Zbl 1086.05030) Full Text: DOI
Bodlaender, Hans L.; Fomin, Fedor V. Equitable colorings of bounded treewidth graphs. (English) Zbl 1086.68096 Theor. Comput. Sci. 349, No. 1, 22-30 (2005). MSC: 68R10 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{H. L. Bodlaender} and \textit{F. V. Fomin}, Theor. Comput. Sci. 349, No. 1, 22--30 (2005; Zbl 1086.68096) Full Text: DOI
Slany, Wolfgang Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (English) Zbl 1061.05090 Theor. Comput. Sci. 289, No. 1, 829-843 (2002). MSC: 05C85 91A43 05C55 68Q17 68R10 PDFBibTeX XMLCite \textit{W. Slany}, Theor. Comput. Sci. 289, No. 1, 829--843 (2002; Zbl 1061.05090) Full Text: DOI
Li, H.; Li, Jianping Independent triangles covering given vertices of a graph. (English) Zbl 0972.05039 Theor. Comput. Sci. 263, No. 1-2, 333-344 (2001). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{H. Li} and \textit{J. Li}, Theor. Comput. Sci. 263, No. 1--2, 333--344 (2001; Zbl 0972.05039) Full Text: DOI
Reischuk, R. Can large fanin circuits perform reliable computations in the presence of faults? (English) Zbl 0945.68017 Theor. Comput. Sci. 240, No. 2, 319-335 (2000). MSC: 68M20 PDFBibTeX XMLCite \textit{R. Reischuk}, Theor. Comput. Sci. 240, No. 2, 319--335 (2000; Zbl 0945.68017) Full Text: DOI
Andreae, Thomas; Hartenstein, Felix; Wolter, Andrea A two-person game on graphs where each player tries to encircle his opponent’s men. (English) Zbl 0916.90292 Theor. Comput. Sci. 215, No. 1-2, 305-323 (1999). MSC: 91A43 91A05 91A24 PDFBibTeX XMLCite \textit{T. Andreae} et al., Theor. Comput. Sci. 215, No. 1--2, 305--323 (1999; Zbl 0916.90292) Full Text: DOI
Gargano, Luisa; Rescigno, Adele A. Communication complexity of fault-tolerant information diffusion. (English) Zbl 0912.68028 Theor. Comput. Sci. 209, No. 1-2, 195-211 (1998). MSC: 68P99 PDFBibTeX XMLCite \textit{L. Gargano} and \textit{A. A. Rescigno}, Theor. Comput. Sci. 209, No. 1--2, 195--211 (1998; Zbl 0912.68028) Full Text: DOI
Grolmusz, Vince On the power of circuits with gates of low \(L_{1}\) norms. (English) Zbl 1053.68575 Theor. Comput. Sci. 188, No. 1-2, 117-128 (1997). MSC: 68Q15 68Q25 PDFBibTeX XMLCite \textit{V. Grolmusz}, Theor. Comput. Sci. 188, No. 1--2, 117--128 (1997; Zbl 1053.68575) Full Text: DOI
Hromkovič, Juraj; Jeschke, Claus-Dieter; Monien, Burkhard Note on optimal gossiping in some weak-connected graphs. (English) Zbl 0824.68010 Theor. Comput. Sci. 127, No. 2, 395-402 (1994). MSC: 68M10 68R10 PDFBibTeX XMLCite \textit{J. Hromkovič} et al., Theor. Comput. Sci. 127, No. 2, 395--402 (1994; Zbl 0824.68010) Full Text: DOI