Search results for "CTW"

Hits ?▲	Authors	Title	Venue	Year	Link
113	Aurélien Garivier	Redundancy of the Context-Tree Weighting Method on Renewal and Markov Renewal Processes.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
52	Takumi Okazaki, Kunihiko Sadakane, Hiroshi Imai	Data Compression Method Combining Properties of PPM and CTW.	Progress in Discovery Science	2002	DBLP DOI BibTeX RDF
48	Sonia Cafieri, Antonio Mucherino, Giacomo Nannicini, Fabien Tarissan, Leo Liberti (eds.)	Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009	CTW	2009	DBLP BibTeX RDF
48	André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria	Recognition of Reducible Flow Hypergraphs.	CTW	2009	DBLP BibTeX RDF
48	Valeria A. Leoni, Maria Patricia Dobson, Graciela L. Nasini	Recognizing Edge-Perfect Graphs: some Polynomial Instances.	CTW	2009	DBLP BibTeX RDF
48	Lucile Belgacem, Irène Charon, Olivier Hudry	Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict Graphs.	CTW	2009	DBLP BibTeX RDF
48	Ramesh Bhandari	The Sliding Shortest Path Algorithms.	CTW	2009	DBLP BibTeX RDF
48	Henning Fernau, Daniel Raible 0001	Packing Paths: Recycling Saves Time.	CTW	2009	DBLP BibTeX RDF
48	Alberto Ceselli, Roberto Cordone, Marco Cremonini	Balanced Clustering for Efficient Detection of Scientific Plagiarism.	CTW	2009	DBLP BibTeX RDF
48	Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey	The Anonymous Subgraph Problem.	CTW	2009	DBLP BibTeX RDF
48	Ulrich Faigle, Jan Voss	A System-Theoretic Model for Cooperation and Allocation Mechanisms.	CTW	2009	DBLP BibTeX RDF
48	Vassilis Giakoumakis, Cheikh Brahim Ooud El Mounir	Enumerating all Finite Sets of Minimal Prime Extensions of Graphs.	CTW	2009	DBLP BibTeX RDF
48	Stefanie Kosuch, Abdel Lisser	On a Two-Stage Stochastic Knapsack Problem with Probabilistic Constraint.	CTW	2009	DBLP BibTeX RDF
48	Michael Brinkmeier	Increasing the Edge Connectivity by One in O(lambda_G n^2 log* n) Expected Time.	CTW	2009	DBLP BibTeX RDF
48	Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini	Improved Strategies for Branching on General Disjunctions.	CTW	2009	DBLP BibTeX RDF
48	José M. Sigarreta Almira, Ismael González Yero, Sergio Bermudo, Juan Alberto Rodríguez-Velázquez	On the Decomposition of Graphs into Offensive k-Alliances.	CTW	2009	DBLP BibTeX RDF
48	Dirk Müller	Faster Min-Max Resource Sharing and Applications.	CTW	2009	DBLP BibTeX RDF
48	Fábio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França	The Open Capacitated Arc Routing Problem.	CTW	2009	DBLP BibTeX RDF
48	Gyula Y. Katona, Illés Horváth	Extremal Stable Graphs.	CTW	2009	DBLP BibTeX RDF
48	Walid Ben-Ameur, José Neto	A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems.	CTW	2009	DBLP BibTeX RDF
48	Enrico Grande, Pitu B. Mirchandani, Andrea Pacifici	Column Generation for the Multicommodity Min-cost Flow Over Time Problem.	CTW	2009	DBLP BibTeX RDF
48	Harald Gropp	From Sainte-Laguü to Claude Berge - French Graph Theory in the Twentieth Century.	CTW	2009	DBLP BibTeX RDF
48	Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza	A Branch-and-Price Approach for the Partition Coloring Problem.	CTW	2009	DBLP BibTeX RDF
48	Abdelfattah Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Rachid Saad	Colored Trees in Edge-Colored Graphs.	CTW	2009	DBLP BibTeX RDF
48	Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon	Minimum Sum Set Coloring on some Subclasses of Block Graphs.	CTW	2009	DBLP BibTeX RDF
48	Marco Casazza, Alberto Ceselli, Marc Nunkesser	Efficient Algorithms for the Double Traveling Salesman Problem with Multiple Stacks.	CTW	2009	DBLP BibTeX RDF
48	Rüdiger Schultz	Decomposition Methods for Stochastic Integer Programs with Dominance Constraints.	CTW	2009	DBLP BibTeX RDF
48	Fabio Roda, Leo Liberti, Franco Raimondi	Combinatorial Optimization Based Recommender Systems.	CTW	2009	DBLP BibTeX RDF
48	Andrea Lodi 0001, Ted K. Ralphs	Bilevel Programming and Maximally Violated Valid Inequalities.	CTW	2009	DBLP BibTeX RDF
48	Ignasi Sau, Dimitrios M. Thilikos	On Self-Duality of Branchwidth in Graphs of Bounded Genus.	CTW	2009	DBLP BibTeX RDF
48	Petros A. Petrosyan, H. E. Sargsyan	On Resistance of Graphs.	CTW	2009	DBLP BibTeX RDF
48	Rüdiger Stephan	Classification of 0/1-Facets of the Hop Constrained Path Polytope Defined on an Acyclic Digraph.	CTW	2009	DBLP BibTeX RDF
48	Changxing Dong, Christian Ernst, Gerold Jäger, Dirk Richter, Paul Molitor	Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones.	CTW	2009	DBLP BibTeX RDF
48	Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasileios Syrgkanis	Colored Resource Allocation Games.	CTW	2009	DBLP BibTeX RDF
48	Andrew Lyons	Acyclic and Star Colorings of Joins of Graphs and an Algorithm for Cographs.	CTW	2009	DBLP BibTeX RDF
48	Gunnar Brinkmann, Nicolas Van Cleemput	NANOCONES - A Classification Result in Chemistry.	CTW	2009	DBLP BibTeX RDF
48	Rita Macedo, Cláudio Alves, José M. Valério de Carvalho	Exact Algorithms for Vehicle Routing Problems with Different Service Constraints.	CTW	2009	DBLP BibTeX RDF
48	Le Anh Vinh	Distribution of Permanent of Matrices with Restricted Entries over Finite Fields.	CTW	2009	DBLP BibTeX RDF
48	Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible 0001	Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.	CTW	2009	DBLP BibTeX RDF
48	Valentina Cacchiani, Alberto Caprara, Matteo Fischetti	Robustness in Train Timetabling.	CTW	2009	DBLP BibTeX RDF
48	Claudio Arbib, Fabrizio Marinelli 0001, Carlo M. Scoppola	A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks.	CTW	2009	DBLP BibTeX RDF
48	Ross J. Kang, Tobias Müller 0001	Acyclic and Frugal Colourings of Graphs.	CTW	2009	DBLP BibTeX RDF
48	María Soto, André Rossi, Marc Sevaux	Two Upper Bounds on the Chromatic Number.	CTW	2009	DBLP BibTeX RDF
48	Anna Galluccio, Claudio Gentile, M. Macina, Paolo Ventura	The k-Gear Composition and the Stable Set Polytope.	CTW	2009	DBLP BibTeX RDF
48	Dmitrii Lozovanu, Stefan Pickl	Algorithmic Solutions of Discrete Control Problems on Stochastic Networks.	CTW	2009	DBLP BibTeX RDF
48	Fabien Tarissan, Camilo La Rota	Inferring Update Sequences in Boolean Gene Regulatory Networks.	CTW	2009	DBLP BibTeX RDF
48	Takeya Shigezumi, Yushi Uno, Osamu Watanabe 0001	A Replacement Model for a Scale-Free Property of Cliques.	CTW	2009	DBLP BibTeX RDF
48	Raphael Machado, Celina M. H. de Figueiredo	NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord.	CTW	2009	DBLP BibTeX RDF
48	Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe	Partial Characterizations of Circle Graphs.	CTW	2009	DBLP BibTeX RDF
48	Stavros D. Nikolopoulos, Charis Papadopoulos	A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs.	CTW	2009	DBLP BibTeX RDF
48	Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy	On Multi-Agent Knapsack Problems.	CTW	2009	DBLP BibTeX RDF
48	Manuel Bodirsky, Gustav Nordh, Timo von Oertzen	Integer Programming with 2-Variable Equations and 1-Variable Inequalities.	CTW	2009	DBLP BibTeX RDF
48	Roberto Cordone, Federico Ficarelli, Giovanni Righini	Bounds and Solutions for Strategic, Tactical and Operational Ambulance Location.	CTW	2009	DBLP BibTeX RDF
48	Cédric Bentz	On Planar and Directed Multicuts with few Source-Sink Pairs.	CTW	2009	DBLP BibTeX RDF
48	Antonio Mucherino, Carlile Lavor, Nelson Maculan	The Molecular Distance Geometry Problem Applied to Protein Conformations.	CTW	2009	DBLP BibTeX RDF
48	Jon Lee 0001	On the Boundary of Tractability for Nonlinear Discrete Optimization.	CTW	2009	DBLP BibTeX RDF
48	Edoardo Amaldi, Stefano Coniglio, Kanika Dhyani	k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic.	CTW	2009	DBLP BibTeX RDF
48	Ingmar Schüle, Hendrik Ewe, Karl-Heinz Küfer	Finding Tight RLT Formulations for Quadratic Semi-Assignment Problems.	CTW	2009	DBLP BibTeX RDF
48	Maria Aguieiras A. de Freitas, Nair Maria Maia de Abreu, Renata R. Del-Vecchio	Some Infinite Families of Q-Integral Graphs.	CTW	2009	DBLP BibTeX RDF
48	Andrea Scozzari, Fabio Tardella	On the Complexity of Graph-Based Bounds for the Probability Bounding Problem.	CTW	2009	DBLP BibTeX RDF
48	Maurizio Bruglieri, Alberto Colorni, Alessandro Lué	The Parking Warden Tour Problem.	CTW	2009	DBLP BibTeX RDF
48	Jens Maßberg, Tim Nieberg	Colored Independent Sets.	CTW	2009	DBLP BibTeX RDF
48	Vadim V. Lozin	A Note on the Parameterized Complexity of the Maximum Independent Set Problem.	CTW	2009	DBLP BibTeX RDF
48	Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger	Combinatorial Optimization Problems with Conflict Graphs.	CTW	2009	DBLP BibTeX RDF
48	Fábio Luiz Usberti, José Federico Vizcaino González, Christiano Lyra Filho, Celso Cavellucci	Maintenance Resources Allocation on Power Distribution Networks with a Multi-Objective Framework.	CTW	2009	DBLP BibTeX RDF
48	Rafael Ayala, Desamparados Fernández-Ternero, José Antonio Vilches	The Number of Excellent Discrete Morse Functions on Graphs.	CTW	2009	DBLP BibTeX RDF
48	Guillaume Collet, Rumen Andonov, Nicola Yanev, Jean-François Gibrat	Protein Threading.	CTW	2009	DBLP BibTeX RDF
48	Birgit Engels, Sven Oliver Krumke, Rainer Schrader, Christiane Zeck	Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2.	CTW	2009	DBLP BibTeX RDF
48	Jens Maßberg, Jan Schneider 0002	Rectangle Packing with Additional Restrictions.	CTW	2009	DBLP BibTeX RDF
48	Mirko Maischberger	Optimising Node Coordinates for the Shortest Path Problem.	CTW	2009	DBLP BibTeX RDF
48	José R. Correa, Nicole Megow, Rajiv Raman 0001, Karol Suchan	Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.	CTW	2009	DBLP BibTeX RDF
48	Frauke Liers, G. Pardella	A Simple MAX-CUT Algorithm for Planar Graphs.	CTW	2009	DBLP BibTeX RDF
48	Michel Habib	Diameter and Center Computations in Networks.	CTW	2009	DBLP BibTeX RDF
48	Lucio Bianco, Massimiliano Caramia	An Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Feeding Precedence Relations.	CTW	2009	DBLP BibTeX RDF
48	Kathie Cameron, Joanna B. Fawcett	Intermediate Trees.	CTW	2009	DBLP BibTeX RDF
48	Luidi Simonetti, Yuri Frota, Cid C. de Souza	An Exact Method for the Minimum Caterpillar Spanning Problem.	CTW	2009	DBLP BibTeX RDF
47		2012 Swedish Communication Technologies Workshop, Swe-CTW 2012, Lund, Sweden, October 24-26, 2012	Swe-CTW	2012	DBLP BibTeX RDF
47	Peter Larsson, Lars K. Rasmussen, Mikael Skoglund	Multilayer network-coded ARQ for multiple unicast flows.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47	Maksym A. Girnyk, Ming Xiao 0001, Lars K. Rasmussen	Power allocation for multi-hop decode-and-forward cognitive radio networks with line topology.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47	Du Ho Kang, Zhe Li, Qiuchan Luo, Farnaz Fathali, Alexandre Vizcaino, Jens Zander	Impact of asymmetric transmission power on operator competition in shared spectrum.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47	Iqbal Hussain, Ming Xiao 0001, Lars K. Rasmussen	Unequal error protection of LT codes over noisy channels.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47	Majid Nasiri Khormuji, Mikael Skoglund	Feedback capacity of the bidirectional broadcast channel.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47	Reza Moosavi, Erik G. Larsson	Fast identification of control signaling aided by please-decode-blindly (PDB) messages.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47	Joonas Pääkkönen, K. D. Prathapasinghe Dharmawansa, Camilla Hollanti, Olav Tirkkonen	Distributed storage for proximity based services.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47	Dennis Sundman, Saikat Chatterjee, Mikael Skoglund	FROGS: A serial reversible greedy search algorithm.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47	Mohammad Javad Emadi, Majid Nasiri Khormuji, Mikael Skoglund, Mohammad Reza Aref	On the achievable rate region of a state-dependent MAC with cooperating encoders.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47	Shoaib Amin, Efrain Zenteno, Per Niklas Landin, Daniel Rönnow, Magnus Isaksson, Peter Händel	Noise impact on the identification of digital predistorter parameters in the indirect learning architecture.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47	Hien Quoc Ngo, Michail Matthaiou, Erik G. Larsson	Performance analysis of large scale MU-MIMO with optimal linear receivers.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47	Sheng Huang, Mikael Skoglund	Linear source coding over rings and applications.	Swe-CTW	2012	DBLP DOI BibTeX RDF
47		2011 IEEE Swedish Communication Technologies Workshop, Swe-CTW 2011, Stockholm, Sweden, October 19-21, 2011	Swe-CTW	2011	DBLP BibTeX RDF
47	Thi My Chinh Chu, Trung Quang Duong, Hans-Jürgen Zepernick	Outage probability and ergodic capacity for MIMO-MRT systems under co-channel interference and imperfect CSI.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Ali A. Zaidi, Majid Nasiri Khormuji, Mikael Skoglund	Nonlinear transmission strategies for a general half-duplex AWGN relay channel.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	M. G. Samantha Sriyananda, Jyrki Joutsensalo, Timo Hämäläinen 0002	Blind source separation for OFDM with filtering colored noise out.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Vesa P. Hytönen, Oleksandr Puchko, Thomas Höhne, Thomas Chapman	High-speed single-frequency network for HSDPA.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Oleksandr Puchko, Mikhail Zolotukhin, Vesa P. Hytönen, Thomas Höhne, Thomas Chapman	Enhanced LMMSE equalizer for high-speed single frequency network in HSDPA.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Bhavani Shankar Mysore Rama Rao, Peter von Wrycza, Mats Bengtsson, Björn E. Ottersten	Convergence of the iterative water-filling algorithm in multiple user spectrum sharing scenarios.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Ana-Maria Popescu, Ion Gabriel Tudorache, Andrew H. Kemp 0001	Performance study of node placement for geographic routing in WSNs.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Emil Björnson, Mats Bengtsson, Björn E. Ottersten	Receive combining vs. multistream multiplexing in multiuser MIMO systems.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Lars K. Rasmussen	A constrained optimization approach to nonlinear interference cancellation.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Aleksejs Udalcovs, Vjaceslavs Bobrovs	Investigation of spectrally efficient transmission for differently modulated optical signals in mixed data rates WDM systems.	Swe-CTW	2011	DBLP DOI BibTeX RDF