Giaro, Krzysztof; Rubale, Marek; Małafiejski, Michał Compact scheduling in open shop with zero-one time operations. (English) Zbl 07677576 INFOR 37, No. 1, 37-47 (1999). MSC: 90-XX PDFBibTeX XMLCite \textit{K. Giaro} et al., INFOR 37, No. 1, 37--47 (1999; Zbl 07677576) Full Text: DOI
Wang, Zheng On the complexity of quality of service routing. (English) Zbl 1338.68121 Inf. Process. Lett. 69, No. 3, 111-114 (1999). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{Z. Wang}, Inf. Process. Lett. 69, No. 3, 111--114 (1999; Zbl 1338.68121) Full Text: DOI Link
Szelepcsényi, Robert \(\beta_k\)-complete problems and greediness. (English) Zbl 0990.68073 Comput. Artif. Intell. 18, No. 2, 139-173 (1999). Reviewer: Juraj Hromkovič (Aachen) MSC: 68Q10 68Q05 68Q15 PDFBibTeX XMLCite \textit{R. Szelepcsényi}, Comput. Artif. Intell. 18, No. 2, 139--173 (1999; Zbl 0990.68073)
Gavalec, Martin; Rote, Günter Reachability of fuzzy matrix periods. (English) Zbl 0952.15009 Tatra Mt. Math. Publ. 16, No. 1, 61-79 (1999). Reviewer: Katarína Cechlárová (Košice) MSC: 15B33 68Q25 03E72 PDFBibTeX XMLCite \textit{M. Gavalec} and \textit{G. Rote}, Tatra Mt. Math. Publ. 16, No. 1, 61--79 (1999; Zbl 0952.15009)
Bachl, Sabine Isomorphic subgraphs. (English) Zbl 0965.68065 Kratochvil, Jan (ed.), Graph drawing. 7th international symposium, GD ’99, Štiřín Castle, Czech Republic, September 15-19, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1731, 286-296 (1999). Reviewer: A.Kapralski (Kraków) MSC: 68R10 68Q25 68W05 68U05 05C60 PDFBibTeX XMLCite \textit{S. Bachl}, Lect. Notes Comput. Sci. 1731, 286--296 (1999; Zbl 0965.68065)
Calamoneri, T.; Finocchi, I.; Manoussakis, Y.; Petreschi, R. A parallel approximation algorithm for the max cut problem on cubic graphs. (English) Zbl 0956.05094 Thiagarajan, P. S. (ed.) et al., Advances in computing science - ASIAN ’99. 5th Asian computing science conference, Phuket, Thailand, December 8-10, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1742, 27-36 (1999). MSC: 05C85 68W10 PDFBibTeX XMLCite \textit{T. Calamoneri} et al., Lect. Notes Comput. Sci. 1742, 27--36 (1999; Zbl 0956.05094)
Rothe, Jörg-Matthias Complexity of certificates, heuristics, and counting types, with applications to cryptography and circuit theory. (English) Zbl 0946.68050 Jena: Univ. Jena, Fakultät Mathematik/ Informatik, 159 p. (1999). MSC: 68Q15 68-02 68P25 94A60 94C05 PDFBibTeX XMLCite \textit{J.-M. Rothe}, Complexity of certificates, heuristics, and counting types, with applications to cryptography and circuit theory. Jena: Univ. Jena, Fakultät Mathematik/ Informatik (1999; Zbl 0946.68050)
Kleine Büning, Hans; Lettmann, Theodor Propositional logic: deduction and algorithms. Transl. from the German. (English) Zbl 0957.03001 Cambridge Tracts in Theoretical Computer Science. 48. Cambridge: Cambridge University Press. x, 409 p. (1999). Reviewer: U.Schöning (Ulm) MSC: 03-01 03B05 03B35 03B70 03F20 68W40 03-02 03-04 68Q25 68T15 PDFBibTeX XMLCite \textit{H. Kleine Büning} and \textit{T. Lettmann}, Propositional logic: deduction and algorithms. Transl. from the German. Cambridge: Cambridge University Press (1999; Zbl 0957.03001)
Magyar, Gábor; Johnsson, Mika; Nevalainen, Olli On the exact solution of the euclidean three-matching problem. (English) Zbl 0990.68184 Acta Cybern. 14, No. 2, 357-376 (1999). Reviewer: Heribert Vollmer (Würzburg) MSC: 68W05 68Q25 68W40 PDFBibTeX XMLCite \textit{G. Magyar} et al., Acta Cybern. 14, No. 2, 357--376 (1999; Zbl 0990.68184)
Kruzslicz, Ferenc Improved greedy algorithm for computing approximate median strings. (English) Zbl 0990.68183 Acta Cybern. 14, No. 2, 331-339 (1999). Reviewer: Heribert Vollmer (Würzburg) MSC: 68W05 68W40 68Q25 68W25 PDFBibTeX XMLCite \textit{F. Kruzslicz}, Acta Cybern. 14, No. 2, 331--339 (1999; Zbl 0990.68183)
Zverovich, I. E. Independent transversals of hypergraph edges and bipartite bigraphs. (English. Russian original) Zbl 0940.05047 Cybern. Syst. Anal. 35, No. 2, 324-326 (1999); translation from Kibern. Sist. Anal. 1999, No. 2, 167-170 (1999). Reviewer: I.Tomescu (Bucureşti) MSC: 05C65 68Q17 PDFBibTeX XMLCite \textit{I. E. Zverovich}, Cybern. Syst. Anal. 35, No. 2, 324--326 (1999; Zbl 0940.05047); translation from Kibern. Sist. Anal. 1999, No. 2, 167--170 (1999) Full Text: DOI
Wang, Jie Packing of unequal spheres and automated radiosurgical treatment planning. (English) Zbl 0958.90086 J. Comb. Optim. 3, No. 4, 453-463 (1999). MSC: 90C39 05B40 52C17 68Q17 68R05 90C35 92C50 PDFBibTeX XMLCite \textit{J. Wang}, J. Comb. Optim. 3, No. 4, 453--463 (1999; Zbl 0958.90086) Full Text: DOI
Nedev, Zhivko Prodanov Finding an even simple path in a directed planar graph. (English) Zbl 0939.68088 SIAM J. Comput. 29, No. 2, 685-695 (1999). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{Z. P. Nedev}, SIAM J. Comput. 29, No. 2, 685--695 (1999; Zbl 0939.68088) Full Text: DOI
Gurvich, V.; Khachiyan, L. On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. (English) Zbl 0953.06013 Discrete Appl. Math. 96-97, 363-373 (1999). Reviewer: Heribert Vollmer (Würzburg) MSC: 06E30 68Q17 94C10 PDFBibTeX XMLCite \textit{V. Gurvich} and \textit{L. Khachiyan}, Discrete Appl. Math. 96--97, 363--373 (1999; Zbl 0953.06013) Full Text: DOI
McDiarmid, Colin Pattern minimisation in cutting stock problems. (English) Zbl 0987.90085 Discrete Appl. Math. 98, No. 1-2, 121-130 (1999). MSC: 90C35 90C39 68Q17 PDFBibTeX XMLCite \textit{C. McDiarmid}, Discrete Appl. Math. 98, No. 1--2, 121--130 (1999; Zbl 0987.90085) Full Text: DOI
Bürgisser, Peter On the structure of Valiant’s complexity classes. (English) Zbl 0947.68061 Discrete Math. Theor. Comput. Sci. 3, No. 3, 73-94 (1999). MSC: 68Q15 PDFBibTeX XMLCite \textit{P. Bürgisser}, Discrete Math. Theor. Comput. Sci. 3, No. 3, 73--94 (1999; Zbl 0947.68061) Full Text: EuDML EMIS
Wegener, Ingo Theoretical computer science – an algorithms-oriented introduction. 2., durchgesehene Aufl. (Theoretische Informatik – eine algorithmenorientierte Einführung.) (German) Zbl 0940.68060 Leitfäden der Informatik. Stuttgart: Teubner. ix, 238 S. (1999). Reviewer: Gunther Schmidt (Neubiberg) MSC: 68Q15 68-01 68Q45 68Q05 PDFBibTeX XMLCite \textit{I. Wegener}, Theoretische Informatik -- eine algorithmenorientierte Einführung. 2., durchgesehene Aufl. Stuttgart: Teubner (1999; Zbl 0940.68060)
Hermann, Miki; Kolaitis, Phokion G. Computational complexity of simultaneous elementary matching problems. (English) Zbl 0936.03014 J. Autom. Reasoning 23, No. 2, 107-136 (1999). MSC: 03B35 68Q17 68T15 PDFBibTeX XMLCite \textit{M. Hermann} and \textit{P. G. Kolaitis}, J. Autom. Reasoning 23, No. 2, 107--136 (1999; Zbl 0936.03014) Full Text: DOI
Raghavachari, Balaji; Veerasamy, Jeyakesavan A \(3/2\)-approximation algorithm for the mixed postman problem. (English) Zbl 0947.90096 SIAM J. Discrete Math. 12, No. 4, 425-433 (1999). MSC: 90C27 90B05 05C85 68R10 05C38 05C45 PDFBibTeX XMLCite \textit{B. Raghavachari} and \textit{J. Veerasamy}, SIAM J. Discrete Math. 12, No. 4, 425--433 (1999; Zbl 0947.90096) Full Text: DOI
Kratochvíl, Jan; Tuza, Zsolt Rankings of directed graphs. (English) Zbl 0932.05032 SIAM J. Discrete Math. 12, No. 3, 374-384 (1999). Reviewer: G.Gutin (Odense) MSC: 05C15 05C20 05C05 05C85 PDFBibTeX XMLCite \textit{J. Kratochvíl} and \textit{Z. Tuza}, SIAM J. Discrete Math. 12, No. 3, 374--384 (1999; Zbl 0932.05032) Full Text: DOI
Wang, Jie Distributional word problem for groups. (English) Zbl 0943.20027 SIAM J. Comput. 28, No. 4, 1264-1283 (1999). MSC: 20F10 68Q15 20F05 PDFBibTeX XMLCite \textit{J. Wang}, SIAM J. Comput. 28, No. 4, 1264--1283 (1999; Zbl 0943.20027) Full Text: DOI
Fraenkel, Aviezri S. Protein folding, spin glass and computational complexity. (English) Zbl 0955.92014 Rubin, Harvey (ed.) et al., DNA based computers III. Proceedings of the 3rd DIMACS workshop, Princeton Univ., NJ, USA, June 23-25, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 48, 101-121 (1999). Reviewer: Gunter Ritter (Passau) MSC: 92C40 65Y20 82D30 92-08 PDFBibTeX XMLCite \textit{A. S. Fraenkel}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 48, 101--121 (1999; Zbl 0955.92014)
Fekete, Sándor P.; Hochstättler, Winfried; Kromberg, Stephan; Moll, Christoph The complexity of an inverse shortest paths problem. (English) Zbl 0928.05016 Graham, Ronald L. (ed.) et al., Contemporary trends in discrete mathematics. From DIMACS and DIMATIA to the future. Proceedings of the DIMATIA-DIMACS conference, Štiřín Castle, Czech Republic, May 19–25, 1997. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 49, 113-127 (1999). Reviewer: F.Plastria (Brussels) MSC: 05C12 68Q25 PDFBibTeX XMLCite \textit{S. P. Fekete} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 49, 113--127 (1999; Zbl 0928.05016)
Pichler, Reinhard Solving equational problems efficiently. (English) Zbl 0937.03019 Ganzinger, Harald (ed.), Automated deduction - CADE-16. 16th international conference, Trento, Italy, July 7-10, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1632, 97-111 (1999). MSC: 03B35 68Q25 03D15 PDFBibTeX XMLCite \textit{R. Pichler}, Lect. Notes Comput. Sci. 1632, 97--111 (1999; Zbl 0937.03019)
Kosheleva, Olga; Kreinovich, Vladik Error estimation for indirect measurements: Interval computation problem is (slightly) harder than a similar probabilistic computational problem. (English) Zbl 0942.65047 Reliab. Comput. 5, No. 1, 81-95 (1999). Reviewer: S.Markov (Sofia) MSC: 65G30 68Q17 65Y20 PDFBibTeX XMLCite \textit{O. Kosheleva} and \textit{V. Kreinovich}, Reliab. Comput. 5, No. 1, 81--95 (1999; Zbl 0942.65047) Full Text: DOI
Blasum, Ulrich; Bussieck, Michael R.; Hochstättler, Winfried; Moll, Christoph; Scheel, Hans-Helmut; Winter, Thomas Scheduling trams in the morning. (English) Zbl 0947.90044 Math. Methods Oper. Res. 49, No. 1, 137-148 (1999). MSC: 90B35 PDFBibTeX XMLCite \textit{U. Blasum} et al., Math. Methods Oper. Res. 49, No. 1, 137--148 (1999; Zbl 0947.90044)
Cechlárová, Katarína; Diko, Pavel Resolving infeasibility in extremal algebras. (English) Zbl 0932.15009 Linear Algebra Appl. 290, No. 1-3, 267-273 (1999). Reviewer: R.Covaci (Cluj-Napoca) MSC: 15A30 68Q25 15A06 PDFBibTeX XMLCite \textit{K. Cechlárová} and \textit{P. Diko}, Linear Algebra Appl. 290, No. 1--3, 267--273 (1999; Zbl 0932.15009) Full Text: DOI
de Figueiredo, Celina M. H.; Faria, Luerbio; Mendonça, Candido F. X. Optimal node-degree bounds for the complexity of nonplanarity parameters. (English) Zbl 0938.68077 Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17-19, 1999. Philadelphia, PA: SIAM. S 887-S 888 (1999). MSC: 68R10 05C99 PDFBibTeX XMLCite \textit{C. M. H. de Figueiredo} et al., in: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, SODA '99. Baltimore, MD, USA, January 17--19, 1999. Philadelphia, PA: SIAM. 887--888 (1999; Zbl 0938.68077)
Harrison, S. A.; Rayward-Smith, V. J. Minimal cost linkages in graphs. (English) Zbl 0921.90140 Ann. Oper. Res. 86, 295-319 (1999). MSC: 90C35 PDFBibTeX XMLCite \textit{S. A. Harrison} and \textit{V. J. Rayward-Smith}, Ann. Oper. Res. 86, 295--319 (1999; Zbl 0921.90140) Full Text: DOI
Brandstädt, Andreas; Van Bang Le; Spinrad, Jeremy P. Graph classes: a survey. (English) Zbl 0919.05001 SIAM Monographs on Discrete Mathematics. and Applications, 3. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. xi, 304 p. (1999). Reviewer: H.Bodlaender (Utrecht) MSC: 05-02 05Cxx 05C75 05C85 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Graph classes: a survey. Philadelphia, PA: SIAM (1999; Zbl 0919.05001) Full Text: DOI
Sorensen, Roy A. Mirror notations: Symbol manipulation without inscription manipulation. (English) Zbl 0933.03045 J. Philos. Log. 28, No. 2, 141-164 (1999). Reviewer: Marius Zimand (Towson) MSC: 03D10 68Q05 03B35 68Q25 PDFBibTeX XMLCite \textit{R. A. Sorensen}, J. Philos. Log. 28, No. 2, 141--164 (1999; Zbl 0933.03045) Full Text: DOI
Schröder, Bernd S. W. Algorithms for the fixed point property. (English) Zbl 0914.68046 Theor. Comput. Sci. 217, No. 2, 301-358 (1999). MSC: 68P10 68W10 PDFBibTeX XMLCite \textit{B. S. W. Schröder}, Theor. Comput. Sci. 217, No. 2, 301--358 (1999; Zbl 0914.68046) Full Text: DOI
Cooper, Martin C. Linear-time algorithms for testing the realisability of line drawings of curved objects. (English) Zbl 0914.68193 Artif. Intell. 108, No. 1-2, 31-67 (1999). MSC: 68U05 68W10 PDFBibTeX XMLCite \textit{M. C. Cooper}, Artif. Intell. 108, No. 1--2, 31--67 (1999; Zbl 0914.68193) Full Text: DOI
Mahadev, N. V. R.; Reed, B. A. A note on vertex orders for stability number. (English) Zbl 0918.05086 J. Graph Theory 30, No. 2, 113-120 (1999). Reviewer: H.-J.Presia (Ilmenau) MSC: 05C75 05C35 68R10 05C85 PDFBibTeX XMLCite \textit{N. V. R. Mahadev} and \textit{B. A. Reed}, J. Graph Theory 30, No. 2, 113--120 (1999; Zbl 0918.05086)