Search results for "CTW"

Hits ?▲	Authors	Title	Venue	Year	Link
18	Oliver Schaudt, Rainer Schrader, Vera Weil	On the Separability of Graphs.	CTW	2012	DBLP BibTeX RDF
18	Arnd Hübsch, Ursula Walther	Modeling Contagion Risk and Financial System Stability by Graphs - The Impact of Network Inhomogeneities.	CTW	2012	DBLP BibTeX RDF
18	Hélio B. Macêdo Filho, Simone Dantas, Raphael C. S. Machado, Celina M. H. de Figueiredo	Biclique-colouring - Powers of Paths and Powers of Cycles.	CTW	2012	DBLP BibTeX RDF
18	Susanna Reiss	On Semidefinite Programs that Provide Geometric Views on Eigenspaces of the Laplacian of a Graph.	CTW	2012	DBLP BibTeX RDF
18	Vladislav Bína, Jiri Pribil	An Open Problem of Star-like Graph Enumeration.	CTW	2012	DBLP BibTeX RDF
18	Márcia R. Cerioli, Lucas Pierezan	On b-continuity of Distance-Hereditary Graphs.	CTW	2012	DBLP BibTeX RDF
18	Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt	The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs.	CTW	2012	DBLP BibTeX RDF
18	Geetanjali Panda, Ajay Kumar Bhurjee	Efficient Solution of Interval Valued Quadratic Programming Problem.	CTW	2012	DBLP BibTeX RDF
18	Mariusz Felisiak, Daniel Simson	On Coxeter Spectral Study of Edge-bipartite Graphs in Relation with Dynkin Diagrams.	CTW	2012	DBLP BibTeX RDF
18	Yuan Feng, Theo S. H. Driessen	A Potential Approach to Efficient, Multiplicative and Symmetric Values for TU Games.	CTW	2012	DBLP BibTeX RDF
18	Guillermo De Ita Luna, Fernando Zacarías Flores, José Raymundo Marcial-Romero	An Approximate Algorithm for the Chromatic Number of a Graph.	CTW	2012	DBLP BibTeX RDF
18	Kaio Karam, Christiane Neme Campos	Fulkerson's Conjecture and Loupekine's Snarks.	CTW	2012	DBLP BibTeX RDF
18	Andreas Bley	An Update on the Complexity of Edge-disjoint Length-equal-3 Paths Problems.	CTW	2012	DBLP BibTeX RDF
18	N. S. Narayanaswamy, G. Ramakrishna	Characterization of Minimum Cycle Basis in Weighted Partial 2-trees.	CTW	2012	DBLP BibTeX RDF
18	Oliver Schaudt, Vera Weil	Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant.	CTW	2012	DBLP BibTeX RDF
18	R. Mert Yüzsever, Tínaz Ekim, Necati Aras	A Branch-and-Price Algorithm for Split-Coloring Problem.	CTW	2012	DBLP BibTeX RDF
18	Fabio Colombo, Roberto Cordone, Marco Trubian	Upper and Lower Bounds for the Homogeneous Areas Problem.	CTW	2012	DBLP BibTeX RDF
18	Fabio Roda, Alberto Costa	Bipartite Modularity Based Clustering for Collaborative Filtering.	CTW	2012	DBLP BibTeX RDF
18	Vadim Bugaenko, Yonah Cherniavsky, Tatiana Nagnibeda, Robert Shwartz	Weighted Coxeter Graphs, Geometric Representation and Generalized Numbers Games.	CTW	2012	DBLP BibTeX RDF
18	Laxman Saha, Pratima Panigrahi	Improved Lower Bound for Radio Number of an Arbitrary Graph.	CTW	2012	DBLP BibTeX RDF
18	Faisal N. Abu-Khzam, Michael A. Langston	Almost Exact Graph 3-Coloring in O(1.277^n) Time.	CTW	2012	DBLP BibTeX RDF
18	Christian Engels, Bodo Manthey, B. V. Raghavendra Rao	Random Shortest Path Metrics with Applications.	CTW	2012	DBLP BibTeX RDF
18	Hassan L. Hijazi, Leo Liberti	Invex Formulations of Unbounded Disjunctions.	CTW	2012	DBLP BibTeX RDF
18	Didier El Baz, Mhand Hifi, Toufik Saadi	Peer-to-Peer Solution of 2D Cutting Stocks Problems.	CTW	2012	DBLP BibTeX RDF
18	Sonia De Cosmis, Renato De Leone	Support Vector Machines for Robust Regression.	CTW	2012	DBLP BibTeX RDF
18	Andreas Brieden, Zafer-Korcan Görgülü, Tino Krug, Erik Kropat, Silja Meyer-Nieberg, Goran Mihelcic, Stefan Wolfgang Pickl (eds.)	11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Munich, Germany, May 29-31, 2012. Extended Abstracts.	CTW	2012	DBLP BibTeX RDF
18	Gunnar Brinkmann, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann, Diana Sasaki	Snarks with Total Chromatic Number 5.	CTW	2012	DBLP BibTeX RDF
18	Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein	On the Oriented Chromatic Number of Union of Graphs.	CTW	2012	DBLP BibTeX RDF
18	Francisco Cisternas, Diego Delle Donne, Guillermo Durán, Cristian Polgatiz, Andrés Weintraub	Integer Programming for Optimizing Salmon Farm Cage Net Use.	CTW	2012	DBLP BibTeX RDF
18	Flavia Bonomo, Monia Giandomenico, Fabrizio Rossi	On the Cornaz-Jost Transformation to Solve the Graph Coloring Problem.	CTW	2012	DBLP BibTeX RDF
18	Marco Pellegrini 0002, Renato De Leone, Pierluigi Maponi	Adaptive Sampling for Embedded Software Systems Using SVM: Application to Water Level Sensors.	CTW	2012	DBLP BibTeX RDF
18	Andreas Brieden, Peter Gritzmann, Michael Öllinger	Optimal Robustness of Supply Chains.	CTW	2012	DBLP BibTeX RDF
18	Leo Liberti	Modelling Rank Constraints in Mathematical Programming.	CTW	2012	DBLP BibTeX RDF
18	Dainis Zeps	On Building 4-critical Plane and Projective Plane Multiwheels from Odd Wheels.	CTW	2012	DBLP BibTeX RDF
18	Ekrem Duman, Ali Fuat Alkaya	An Application of the Sequence Dependent TSP in PCB Assembly.	CTW	2012	DBLP BibTeX RDF
18	Peter Brucker	A Car Rental Problem at the German Bundeswehr.	CTW	2012	DBLP BibTeX RDF
18	Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee	A (5/3 + eps)-Approximation for 2D Strip Packing.	CTW	2012	DBLP BibTeX RDF
18	Tiziana Calamoneri, Blerina Sinaimeri	Labeling of Oriented Planar Graphs.	CTW	2011	DBLP BibTeX RDF
18	Paolo Dell'Olmo, Raffaele Cerulli, Francesco Carrabs	The maximum labeled clique problem.	CTW	2011	DBLP BibTeX RDF
18	Joanna Bauer	One Minimum-Cost Network Flow Problem to Identify a Graph's Connected Components.	CTW	2011	DBLP BibTeX RDF
18	Martin Milanic	A hereditary view on efficient domination.	CTW	2011	DBLP BibTeX RDF
18	Ludovica Adacher, Marta Flamini	Modeling and solving aircrafts scheduling problem in ground control.	CTW	2011	DBLP BibTeX RDF
18	Endre Boros, Vincenzo Spinelli, Federica Ricca	Incompatibility graphs and data mining.	CTW	2011	DBLP BibTeX RDF
18	Ludovica Adacher, Marta Flamini, Gianmaria Leo, Gaia Nicosia, Andrea Pacifici, Veronica Piccialli (eds.)	Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011	CTW	2011	DBLP BibTeX RDF
18	Nora Touati Moungla, Dimo Brockhoff	An Evolutionary Algorithm for the Multiobjective Risk-Equity Constrained Routing Problem.	CTW	2011	DBLP BibTeX RDF
18	Martin Charles Golumbic	Graph sandwich problems.	CTW	2011	DBLP BibTeX RDF
18	Paolo Serafini	Separating negative and positive points with the minimum number of boxes.	CTW	2011	DBLP BibTeX RDF
18	Martin Kochol	Decomposition of Tutte Polynomial.	CTW	2011	DBLP BibTeX RDF
18	Petr A. Golovach, Marcin Kaminski 0001, Dimitrios M. Thilikos	Odd cyclic surface separators in planar graphs.	CTW	2011	DBLP BibTeX RDF
18	Manuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori	Models and Algorithms for the Bin Packing Problem with Fragile Objects.	CTW	2011	DBLP BibTeX RDF
18	Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende	Effective drawing of proportional symbol maps using GRASP.	CTW	2011	DBLP BibTeX RDF
18	Alberto Ceselli, Giovanni Righini, Emanuele Tresoldi	Combined Location and Routing Problems in Drug Distribution.	CTW	2011	DBLP BibTeX RDF
18	Marianna De Santis, Stefano Lucidi, Francesco Rinaldi	A New Feasibility Pump-Like Heuristic for Mixed Integer Problems.	CTW	2011	DBLP BibTeX RDF
18	Mette Gamst, Niels Hvidberg Kjeldsen	The Boat and Barge Problem.	CTW	2011	DBLP BibTeX RDF
18	Justo Puerto, Federica Ricca, Andrea Scozzari	Range minimization problems in path-facility location on trees.	CTW	2011	DBLP BibTeX RDF
18	Monique Laurent, Antonios Varvitsiotis	Computing the Grothendieck constant of some graph classes.	CTW	2011	DBLP BibTeX RDF
18	Ulrich Faigle, Alexander Schönhuth	Representations of Power Series over Word Algebras.	CTW	2011	DBLP BibTeX RDF
18	Sergey Sevastyanov, Bertrand M. T. Lin	Efficient enumeration of optimal and approximate solutions of a scheduling problem.	CTW	2011	DBLP BibTeX RDF
18	Jean-François Couturier 0001, Dieter Kratsch	Bicolored independent sets and bicliques.	CTW	2011	DBLP BibTeX RDF
18	Maurizio Bruglieri, Paola Cappanera, Maddalena Nonato	The gateway location problem for hazardous material transportation.	CTW	2011	DBLP BibTeX RDF
18	Paolo Nobili, Antonio Sassano	A reduction algorithm for the weighted stable set problem in claw-free graphs.	CTW	2011	DBLP BibTeX RDF
18	Fabio Roda, Pierre Hansen, Leo Liberti	The price of equity in the Hazmat.	CTW	2011	DBLP BibTeX RDF
18	Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels	A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs.	CTW	2011	DBLP BibTeX RDF
18	Stefano Coniglio	The impact of the norm on the k-Hyperplane Clustering problem: relaxations, restrictions, approximation factors, and exact formulations.	CTW	2011	DBLP BibTeX RDF
18	Isabel Méndez-Díaz, Juan José Miranda Bront, Paolo Toth, Paula Zabala	Infeasible path formulations for the time-dependent TSP with time windows.	CTW	2011	DBLP BibTeX RDF
18	Suhadi Wido Saputro, Rinovia Simanjuntak, Saladin Uttunggadewa, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman	On graph of order-n with the metric dimension n-3.	CTW	2011	DBLP BibTeX RDF
18	Robert Scheidweiler, Eberhard Triesch	Matchings in balanced hypergraphs.	CTW	2011	DBLP BibTeX RDF
18	Vladislav Bína	Enumeration of Labeled Split Graphs and Counts of Important Superclasses.	CTW	2011	DBLP BibTeX RDF
18	Marco Carli, Federica Pascucci	Sensor Network Localization Using Compressed Extended Kalman Filter.	CTW	2011	DBLP BibTeX RDF
18	Alberto Costa, Pierre Hansen, Leo Liberti	Bound constraints for Point Packing in a Square.	CTW	2011	DBLP BibTeX RDF
18	Alexandre Gaudilliere, Antonio Iovanella, Benedetto Scoppola, Elisabetta Scoppola, Massimiliano Viale	A Probabilistic Cellular Automata algorithm for the clique problem.	CTW	2011	DBLP BibTeX RDF
18	Luis Miguel Torres, Annegret Katrin Wagler	The dynamics of deterministic systems from a hypergraph theoretical point of view.	CTW	2011	DBLP BibTeX RDF
18	Walter Kern, Xian Qiu	Improved Taxation Rate for Bin Packing Games.	CTW	2011	DBLP BibTeX RDF
18	Pablo Factorovich, Isabel Méndez-Díaz, Paula Zabala	The Pickup and Delivery Problem with Incompatibility Constraints.	CTW	2011	DBLP BibTeX RDF
18	Antonio Mucherino, Inken Wohlers, Gunnar W. Klau, Rumen Andonov	Sparsifying Distance Matrices for Protein-Protein Structure Alignments.	CTW	2011	DBLP BibTeX RDF
18	Petros A. Petrosyan, Rafael R. Kamalian	Edge-chromatic sums of regular and bipartite graphs.	CTW	2011	DBLP BibTeX RDF
18	Andrea Abrardo, Marco Belleschi, Paolo Detti	Resources and transmission formats allocation in OFDMA networks.	CTW	2011	DBLP BibTeX RDF
18	N. Narayanan 0001	Minimally 2-connected graphs and colouring problems.	CTW	2011	DBLP BibTeX RDF
18	Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi	On cycle bases with limited edge overlap.	CTW	2011	DBLP BibTeX RDF
18	Sara Nicoloso, Ugo Pietropaoli	Bipartite finite Toeplitz graphs.	CTW	2011	DBLP BibTeX RDF
18	Márcia R. Cerioli, Hugo Nobrega, Petrucio Viana	A partial characterization by forbidden subgraphs of edge path graphs.	CTW	2011	DBLP BibTeX RDF
18	Gabriela R. Argiroffo, Annegret Wagler	Generalized row family inequalities for the set covering polyhedron.	CTW	2011	DBLP BibTeX RDF
18	Flavia Bonomo, Jayme Luiz Szwarcfiter	Characterization of classical graph classes by weighted clique graphs.	CTW	2011	DBLP BibTeX RDF
18	Ronald I. Becker	Research work with Bruno Simeone.	CTW	2011	DBLP BibTeX RDF
18	Zdzislaw Skupien	Majorization and the minimum number of dominating sets.	CTW	2011	DBLP BibTeX RDF
18	Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari	Formulations and heuristics for the k-Piecewise Affine Model Fitting problem.	CTW	2011	DBLP BibTeX RDF
18	Pierre Hansen	Bruno Simeone's Work in Clustering.	CTW	2011	DBLP BibTeX RDF
18	Claudio Arbib, Giovanni Felici, Mara Servilio	Sorting Common Operations to Minimize Tardy Jobs.	CTW	2011	DBLP BibTeX RDF
18	Marco Cello, Giorgio Gnecco, Mario Marchese, Marcello Sanguineti	A Generalized Stochastic Knapsack Problem with Application in Call Admission Control.	CTW	2011	DBLP BibTeX RDF
18	Bernardetta Addis, Giuliana Carello, Federico Malucelli	Network design with SRG based protection.	CTW	2011	DBLP BibTeX RDF
18	Rüdiger Stephan	Reducing the minimum T-cut problem to polynomial size linear programming.	CTW	2011	DBLP BibTeX RDF
18	Alessandro Agnetis, Paolo Detti, Patrick Martineau	Scheduling problems with unreliable jobs and machines.	CTW	2011	DBLP BibTeX RDF
18	Christopher Cullenbine, R. Kevin Wood, Alexandra M. Newman	New Results for the Directed Network Diversion Problem.	CTW	2011	DBLP BibTeX RDF
18	Sergio Bermudo, Henning Fernau	Computing the differential of a graph.	CTW	2011	DBLP BibTeX RDF
18	Marianna De Santis, Stefano Lucidi, Francesco Rinaldi	Continuous Reformulations for Zero-one Programming Problems.	CTW	2011	DBLP BibTeX RDF
18	Leo Liberti, Benoît Masson, Carlile Lavor, Antonio Mucherino	Branch-and-Prune trees with bounded width.	CTW	2011	DBLP BibTeX RDF
18	Roberto Cordone, Guglielmo Lulli 0001	A Lagrangian Relaxation Approach for Gene Regulatory Networks.	CTW	2011	DBLP BibTeX RDF
18	Michele Monaci, Ulrich Pferschy	On the Robust Knapsack Problem.	CTW	2011	DBLP BibTeX RDF
18	Stefanie Kosuch	Approximability of the Two-Stage Knapsack problem with discretely distributed weights.	CTW	2011	DBLP BibTeX RDF
18	Dmitrii Lozovanu, Stefan Pickl	Discounted Markov Decision Processes and Algorithms for Solving Stochastic Control Problem on Networks.	CTW	2011	DBLP BibTeX RDF