Adaptive star grammars and their languagesDREWES, Frank; HOFFMANN, Berthold; JANSSENS, Dirk et al.Theoretical computer science. 2010, Vol 411, Num 34-36, pp 3090-3109, issn 0304-3975, 20 p.Article

Productivity of stream definitionsENDRULLIS, Jörg; GRABMAYER, Clemens; HENDRIKS, Dimitri et al.Theoretical computer science. 2010, Vol 411, Num 4-5, pp 765-782, issn 0304-3975, 18 p.Conference Paper

Mesh Saliency via Spectral ProcessingRAN SONG; YONGHUAI LIU; MARTIN, Ralph R et al.ACM transactions on graphics. 2014, Vol 33, Num 1, issn 0730-0301, 6.1-6.17Article

Necklaces, Convolutions, and X + YBREMNER, David; CHAN, Timothy M; DEMAINE, Erik D et al.Algorithmica. 2014, Vol 69, Num 2, pp 294-314, issn 0178-4617, 21 p.Article

Parameterized complexity of three edge contraction problems with degree constraintsBELMONTE, Rémy; GOLOVACH, Petr A; VAN'T HOF, Pim et al.Acta informatica. 2014, Vol 51, Num 7, pp 473-497, issn 0001-5903, 25 p.Article

Toward the Minimal Universal Petri NetZAITSEV, Dmitry A.IEEE transactions on systems, man, and cybernetics. Systems (Print). 2014, Vol 44, Num 1, pp 47-58, issn 2168-2216, 12 p.Article

Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2ⁿCYGAN, Marek; PILIPCZUK, Marcin; PILIPCZUK, Michał et al.Algorithmica. 2014, Vol 70, Num 2, pp 195-207, issn 0178-4617, 13 p.Conference Paper

A hybrid AC3-tabu search algorithm for solving Sudoku puzzlesSOTO, Ricardo; CRAWFORD, Broderick; GALLEGUILLOS, Cristian et al.Expert systems with applications. 2013, Vol 40, Num 15, pp 5817-5821, issn 0957-4174, 5 p.Article

On Finding Min-Min Disjoint PathsLONGKUN GUO; HONG SHEN.Algorithmica. 2013, Vol 66, Num 3, pp 641-653, issn 0178-4617, 13 p.Article

Structural tractability of enumerating CSP solutionsGRECO, Gianluigi; SCARCELLO, Francesco.Constraints (Dordrecht). 2013, Vol 18, Num 1, pp 38-74, issn 1383-7133, 37 p.Article

On the Min-Max 2-Cluster Editing Problem : SELECTED PAPERS FROM ICS 2012CHEN, Li-Hsuan; CHANG, Maw-Shang; WANG, Chun-Chieh et al.Journal of information science and engineering. 2013, Vol 29, Num 6, pp 1109-1120, issn 1016-2364, 12 p.Article

Fixed-Parameter Evolutionary Algorithms and the Vertex Cover ProblemKRATSCH, Stefan; NEUMANN, Frank.Algorithmica. 2013, Vol 65, Num 4, pp 754-771, issn 0178-4617, 18 p.Article

Asymptotic Enumeration of Extensional Acyclic DigraphsWAGNER, Stephan.Algorithmica. 2013, Vol 66, Num 4, pp 829-847, issn 0178-4617, 19 p.Article

Improved Approximation Algorithms for Data MigrationKHULLER, Samir; KIM, Yoo-Ah; MALEKIAN, Azarakhsh et al.Algorithmica. 2012, Vol 63, Num 1-2, pp 347-362, issn 0178-4617, 16 p.Article

Modeling wildfire propagation with Delaunay triangulation and shortest path algorithmsSTEPANOV, Alexander; MACGREGOR SMITH, James.European journal of operational research. 2012, Vol 218, Num 3, pp 775-788, issn 0377-2217, 14 p.Article

Multi-tilde-bar expressions and their automataCARON, Pascal; CHAMPARNAUD, Jean-Marc; MIGNOT, Ludovic et al.Acta informatica. 2012, Vol 49, Num 6, pp 413-436, issn 0001-5903, 24 p.Article

Pruning 2-Connected GraphsCHEKURI, Chandra; KORULA, Nitish.Algorithmica. 2012, Vol 62, Num 1-2, pp 436-463, issn 0178-4617, 28 p.Article

A linear process-algebraic format with data for probabilistic automataKATOEN, Joost-Pieter; VAN DE POL, Jaco; STOELINGA, Mariëlle et al.Theoretical computer science. 2012, Vol 413, Num 1, pp 36-57, issn 0304-3975, 22 p.Article

Finding the K shortest paths in a schedule-based transit networkWANGTU XU; SHIWEI HE; RUI SONG et al.Computers & operations research. 2012, Vol 39, Num 8, pp 1812-1826, issn 0305-0548, 15 p.Article

Same-decision probability: A confidence measure for threshold-based decisionsCHOI, Arthur; XUE, Yexiang; DARWICHE, Adnan et al.International journal of approximate reasoning. 2012, Vol 53, Num 9, pp 1415-1428, issn 0888-613X, 14 p.Article

A subdivision method for computing nearest gcd with certificationCHEZE, Guillaume; GALLIGO, André; MOURRAIN, Bernard et al.Theoretical computer science. 2011, Vol 412, Num 35, pp 4493-4503, issn 0304-3975, 11 p.Article

A zero-one SUBEXP-dimension law for BPPMOSER, Philippe.Information processing letters. 2011, Vol 111, Num 9, pp 429-432, issn 0020-0190, 4 p.Article

An approximation algorithm dependent on edge-coloring number for minimum maximal matching problemMATSUMOTO, Yusuke; KAMIYAMA, Naoyuki; IMAI, Keiko et al.Information processing letters. 2011, Vol 111, Num 10, pp 465-468, issn 0020-0190, 4 p.Article

An entropy-based uncertainty measure of process modelsJUNG, Jae-Yoon; CHIN, Chang-Ho; CARDOSO, Jorge et al.Information processing letters. 2011, Vol 111, Num 3, pp 135-141, issn 0020-0190, 7 p.Article

An exact algorithm for the Boolean connectivity problem for k-CNFMAKINO, Kazuhisa; TAMAKI, Suguru; YAMAMOTO, Masaki et al.Theoretical computer science. 2011, Vol 412, Num 35, pp 4613-4618, issn 0304-3975, 6 p.Article