Items where Division is "Informatics Laboratory" and Year is 2016

Group by: No Grouping | Item Type | Creators

Jump to: ISI Article | Article | Book Section | Conference or Workshop Item

Number of items: 52.

ISI Article

Date	Author/Title	Document Type
2016	Kerepesi, Csaba and Grolmusz, Vince Evaluating the Quantitative Capabilities of Metagenomic Analysis Software	ISI Article
2016	Kerepesi, Csaba and Grolmusz, Vince Giant viruses of the Kutch Desert	ISI Article
2016-11-14	Kerepesi, Csaba and Szabó, Judit E. and Papp-Kádár, Veronika and Dobay, Orsolya and Szabó, Dóra and Grolmusz, Vince and G. Vertessy, Beata Life without dUTPase	ISI Article
2016-06-30	Kerepesi, Csaba and Szalkai, Balázs and Varga, Bálint and Grolmusz, Vince How to Direct the Edges of the Connectomes: Dynamics of the Consensus Connectomes and the Development of the Connections in the Human Brain	ISI Article
2016	Szalkai, Balázs and Kerepesi, Csaba and Varga, Bálint and Grolmusz, Vince Parameterizable consensus connectomes from the Human Connectome Project: the Budapest Reference Connectome Server v3.0	ISI Article

Article

Date	Author/Title	Document Type
2016	Abdi, A and Feldmann, Andreas Emil and Guenin, B and Konemann, J and Sanita, L Lehman's Theorem and the Directed Steiner Tree Problem	Article
2016	Bonnet, Édouard and Brettel, Nick and Kwon, O-joung and Marx, Dániel Parameterized vertex deletion problems for hereditary graph classes with a block property	Article
2016	Bonnet, Édouard and Escoffier, B and Paschos, V T and Stamoulis, G A 0.821-ratio purely combinatorial algorithm for maximum k-vertex cover in bipartite graphs	Article
2016	Bonnet, Édouard and Jamain, F and Saffidine, A On the complexity of connection games	Article
2016	Bonnet, Édouard and Sikora, F A Note on Edge Isoperimetric Numbers and Regular Graphs	Article
2016	Cao, Yixin and Marx, Dániel Chordal Editing is Fixed-Parameter Tractable	Article
2016	Csató, László and Rónyai, Lajos Incomplete pairwise comparison matrices and weighting methods	Article
2016	Cygan, M and Dell, H and Lokshtanov, D and Marx, Dániel and Nederlof, J On Problems as Hard as CNF-SAT	Article
2016	Demetrovics, János and Hua, Nam Son and Gubán, Ákos A Formal Representation for Structured Data	Article
2016	Feldmann, Andreas Emil and Konemann, J and Olver, N and Sanita, L On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree	Article
2016	Giannopoulou, AC and Kwon, O-joung and Raymond, J-F and Thilikos, DM Packing and covering immersion models of planar subcubic graphs	Article
2016	Hegedűs, István and Berta, Árpád and Kocsis, Levente and Benczúr, András and Jelasity, Márk Robust Decentralized Low-Rank Matrix Decomposition	Article
2016	Hliněný, P and Kwon, O-joung and Obdržálek, J and Ordyniak, S Tree-depth and vertex-minors	Article
2016	Kerepesi, Csaba and Szalkai, Balázs and Varga, Bálint and Grolmusz, Vince How to Direct the Edges of the Connectomes: Dynamics of the Consensus Connectomes and the Development of the Connections in the Human Brain	Article
2016	Kratsch, S and Marx, Dániel and Wahlstrom, M Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems	Article
2016	Pergel, M and Rzazewski, Pavel Michael On edge intersection graphs of paths with 2 bends	Article
2016	Tapolcai, János and Rónyai, Lajos and Hosszu, Éva and Gyimóthi, L and Ho, P-H Signaling Free Localization of Node Failures in All-Optical Networks	Article

Book Section

Date	Author/Title	Document Type
2016	Abel, F and Benczúr, András and Kohlsdorf, D and Larson, M and Pálovics, Róbert RecSys challenge 2016: Job recommendations	Book Section
2016	Amiri, S A and Kreutzer, S and Marx, Dániel and Rabinovich, R Routing with Congestion in Acyclic Digraphs	Book Section
2016	Baffier, J-F and Chiu, M-K and Diez, Y and Korman, M and Mitsou, Valia Hanabi is NP-complete, even for cheaters who look at their cards	Book Section
2016	Bateni, M and Hajiaghayi, M and Demaine, ED and Marx, Dániel A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting	Book Section
2016	Bonnet, Édouard The complexity of playing durak	Book Section
2016	Bonnet, Édouard and Egri, László and Marx, Dániel Fixed-Parameter Approximability of Boolean MinCSPs	Book Section
2016	Bonnet, Édouard and Lampis, M and Paschos, V T Time-approximation trade-offs for inapproximable problems	Book Section
2016	Bonnet, Édouard and Miltzow, Tillmann Parameterized Hardness of Art Gallery Problems	Book Section
2016	Borbély, Gábor and Makrai, Márton and Nemeskey, Dávid Márk and Kornai, András Evaluating multi-sense embeddings for semantic resolution monolingually and in word translation	Book Section
2016	Chen, Lin and Megow, N and Schewior, K The power of migration in online machine minimization	Book Section
2016	Chen, Lin and Ye, D and Zhang, G Approximation algorithms for parallel machine scheduling with speed-up resources	Book Section
2016	Chen, Lin and Zhang, G Packing groups of items into multiple knapsacks	Book Section
2016	Curticapean, Radu Counting Matchings with k Unmatched Vertices in Planar Graphs	Book Section
2016	Curticapean, Radu Parity Separation: A Scientifically Proven Method for Permanent Weight Loss	Book Section
2016	Curticapean, Radu and Marx, Dániel Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus	Book Section
2016	Eiben, E and Ganian, R and Kwon, O-joung A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion	Book Section
2016	Feldmann, Andreas Emil and Marx, Dániel The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems	Book Section
2016	Fomin, FV and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Pilipczuk, M Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering	Book Section
2016	Grilo, Alex B. and Kerenidis, Iordanis and Pereszlényi, Attila Pointer Quantum PCPs and Multi-Prover Games	Book Section
2016	Kornai, András and Nemeskey, Dávid Márk and Recski, Gábor András Detecting Optional Arguments of Verbs	Book Section
2016	Marx, Dániel and Miltzow, Tillmann Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems	Book Section
2016	Marx, Dániel and Mitsou, Valia Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth.	Book Section
2016	Marx, Dániel and Salmasi, A and Sidiropoulos, A Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs	Book Section
2016	Recski, Gábor András and Iklódi, E and Pajkossy, Katalin Anna and Kornai, András Measuring Semantic Similarity of Words Using Concept Networks	Book Section
2016	Vadász, Pál and Benczúr, András and Füzesi, Géza and Munk, Sándor Identifying Illegal Cartel Activities from Open Sources	Book Section
2016	Ács, Judit and Kornai, András Evaluating embeddings on dictionary-based similarity	Book Section

Conference or Workshop Item

Date	Author/Title	Document Type
2016	Bonnet, Édouard and Miltzow, Tillmann An Approximation Algorithm for the Art Gallery Problem	Conference or Workshop Item
2016	Bonnet, Édouard and Miltzow, Tillmann Flip Distance to a Non-crossing Perfect Matching	Conference or Workshop Item
2016	Bonnet, Édouard and Miltzow, Tillmann Parameterized Hardness of Art Gallery Problems	Conference or Workshop Item
2016	Borbély, Gábor and Kornai, András and Kracht, M and Nemeskey, Dávid Márk Denoising composition in distributional semantics	Conference or Workshop Item

This list was generated on Tue Nov 19 03:04:36 2024 CET.

Export as	Atom RSS 1.0 RSS 2.0