Search results for "CTW"

Hits ?▲	Authors	Title	Venue	Year	Link
18	Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk	How to Hunt an Invisible Rabbit on a Graph.	CTW	2015	DBLP BibTeX RDF
18	Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros	A Fixed Parameter Algorithm for Plane Subgraph Completion.	CTW	2015	DBLP BibTeX RDF
18	Ervin Györi, Gyula Y. Katona, László F. Papp	Optimal pebbling of grids.	CTW	2015	DBLP BibTeX RDF
18	Ugur Odabasi, Sibel Özkan	The Hamilton-Waterloo Problem with C4 and Cm Factors.	CTW	2015	DBLP BibTeX RDF
18	Dindar Öz, Ali Fuat Alkaya, Vural Aksakalli	Developing an Exact Method for the Obstacle Neutralization Problem.	CTW	2015	DBLP BibTeX RDF
18	Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy	Price of Fairness for Multiagent Subset Sum Problems.	CTW	2015	DBLP BibTeX RDF
18	Sahar Bsaybes, Alain Quilliot, Annegret Wagler	Fleet management of autonomous vehicles: VIPAFLEET.	CTW	2015	DBLP BibTeX RDF
18	Soumaya Sassi Mahfoudh, Walid Khaznaji, Monia Bellalouna	A Java Implementation of the Branch and Bound Algorithm : the Probabilistic Traveling Salesman Problem.	CTW	2015	DBLP BibTeX RDF
18	Pablo Adasme, Rafael Andrade 0001, Abdel Lisser	Probabilistic constrained dominating trees.	CTW	2015	DBLP BibTeX RDF
18	Gabriel A. Barragán-Ramírez, Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro	Local metric dimension of subgraph-amalgamation of graphs.	CTW	2015	DBLP BibTeX RDF
18	Saad Mneimneh, Saman Farhat	The Offline Carpool Problem.	CTW	2015	DBLP BibTeX RDF
18	Hamid Mokhtar, Sanming Zhou	Recursive cube of rings.	CTW	2015	DBLP BibTeX RDF
18	Ioannis Giotis 0001, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos	An alternative proof for the constructive Asymmetric Lovász Local Lemma.	CTW	2015	DBLP BibTeX RDF
18	Can Eren Sezener, Erhan Öztop	Heuristic algorithms for obtaining Polynomial Threshold Functions with low densities.	CTW	2015	DBLP BibTeX RDF
18	Deborah King, Yang Li, Sanming Zhou	Linear and cyclic distance-three labellings of trees.	CTW	2015	DBLP BibTeX RDF
18	Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane	A Branch-and-Price Algorithm for Optimal Decoding in LDPC-Based Communications.	CTW	2015	DBLP BibTeX RDF
18	Marcin Krzywkowski, Nader Jafari Rad, Sayyed Heidar Jafari	On the intersection graphs of subspaces of a vector space.	CTW	2015	DBLP BibTeX RDF
18	Daya Ram Gaur, Shahadat Hossain, Rishi Ranjan Singh	Star Bi-Coloring of Bipartite Graphs using Column Generation.	CTW	2015	DBLP BibTeX RDF
18	Damián Bakarcic, Gabriela Di Piazza, Isabel Méndez-Díaz, Paula Zabala	An IP based heuristic algorithm for the vehicle and crew scheduling pick-up and delivery problem with time windows.	CTW	2013	DBLP BibTeX RDF
18	Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva	Parameterized and/or graph solution.	CTW	2013	DBLP BibTeX RDF
18	Sourav Chakraborty 0001, Akshay Kamath, Rameshwar Pratap	Testing uniformity of stationary distribution.	CTW	2013	DBLP BibTeX RDF
18	Fabio Roda	Hazmat transportation problem: instance size reduction through centrality erosion.	CTW	2013	DBLP BibTeX RDF
18	Stephan Dominique Andres, Winfried Hochstättler	Perfect digraphs and a strong perfect digraph theorem.	CTW	2013	DBLP BibTeX RDF
18	Ovidiu Listes	Manufacturing process flexibility with robust optimization using AIMMS.	CTW	2013	DBLP BibTeX RDF
18	Danilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter	Geodetic sets and periphery.	CTW	2013	DBLP BibTeX RDF
18	Monique Laurent, Zhao Sun	Handelman's hierarchy for the maximum stable set problem.	CTW	2013	DBLP BibTeX RDF
18	Philipp Klodt, Anke van Zuylen	Toward a precise integrality gap for triangle-free 2-matchings.	CTW	2013	DBLP BibTeX RDF
18	Philipp von Falkenhausen, Tobias Harks	Optimal cost sharing for capacitated facility location games.	CTW	2013	DBLP BibTeX RDF
18	Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit	Balanced Abelian group valued functions on directed graphs: Extended abstract.	CTW	2013	DBLP BibTeX RDF
18	Andrea Munaro	The VC-dimension of graphs with respect to k-connected subgraphs.	CTW	2013	DBLP BibTeX RDF
18	Alain Quilliot, Djamal Rebaine	Approximation results for the linear ordering problem on interval graphs.	CTW	2013	DBLP BibTeX RDF
18	Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos	A linear kernel for planar red-blue dominating set.	CTW	2013	DBLP BibTeX RDF
18	Isabel Méndez-Díaz, Federico Pousa, Paula Zabala	A branch-and-cut algorithm for the angular TSP.	CTW	2013	DBLP BibTeX RDF
18	Jean-François Couturier 0001, Mathieu Liedloff	A tight bound on the number of minimal dominating sets in split graph.	CTW	2013	DBLP BibTeX RDF
18	Nair Maria Maia de Abreu, Maria Aguieiras A. de Freitas, Renata R. Del-Vecchio	Simultaneously integral graphs on three associated matrices.	CTW	2013	DBLP BibTeX RDF
18	Dmitrii Lozovanu, Stefan Pickl	Optimal paths in networks with rated transition time costs.	CTW	2013	DBLP BibTeX RDF
18	Imran Khaliq, Gulshad Imran	Constructing strategies in subclasses of McNaughton games.	CTW	2013	DBLP BibTeX RDF
18	Márcia R. Cerioli, Daniel F. D. Posner	Total L(2, 1)-coloring of graphs.	CTW	2013	DBLP BibTeX RDF
18	Ángel Felipe Ortega, María Teresa Ortuño Sánchez, Gregorio Tirado Domínguez, Giovanni Righini	Exact and heuristic algorithms for the green vehicle routing problem.	CTW	2013	DBLP BibTeX RDF
18	Sven de Vries	Graph products for faster separation of 1-wheel inequalities.	CTW	2013	DBLP BibTeX RDF
18	Elias Dahlhaus	Linear time and almost linear time cases for minimal elimination orderings.	CTW	2013	DBLP BibTeX RDF
18	Stefano Coniglio	Bound-optimal cutting planes.	CTW	2013	DBLP BibTeX RDF
18	Ayumi Igarashi 0001, Yoshitsugu Yamamoto	Computational complexity of the average covering tree value.	CTW	2013	DBLP BibTeX RDF
18	Shariefuddin Pirzada, Muhammad Ali Khan, E. Sampathkumar 0001	Coloring of signed graphs.	CTW	2013	DBLP BibTeX RDF
18	Giulia Galbiati, Stefano Gualandi	Coloring of paths into forests.	CTW	2013	DBLP BibTeX RDF
18	Eglantine Camby, Oliver Schaudt	Connected dominating set in graphs without long paths and cycles.	CTW	2013	DBLP BibTeX RDF
18	Ulrich Faigle, Alexander Schönhuth	Observation and evolution of finite-dimensional Markov systems.	CTW	2013	DBLP BibTeX RDF
18	Haiko Müller, Samuel Wilson	Characterising subclasses of perfect graphs with respect to partial orders related to edge contraction.	CTW	2013	DBLP BibTeX RDF
18	Maciej Liskiewicz, Martin R. Schuster	A new upper bound for the traveling salesman problem in cubic graphs.	CTW	2013	DBLP BibTeX RDF
18	Christoph Buchheim, Laura Klein	The spanning tree problem with one quadratic term.	CTW	2013	DBLP BibTeX RDF
18	Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein	An oriented 8-coloring for acyclic oriented graphs with maximum degree 3.	CTW	2013	DBLP BibTeX RDF
18	Lara Turner, Matthias Ehrgott, Horst W. Hamacher	On the generality of the greedy algorithm for solving matroid problems.	CTW	2013	DBLP BibTeX RDF
18	Kamiel Cornelissen, Ruben Hoeksma, Johann L. Hurink, Bodo Manthey (eds.)	12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013.	CTW	2013	DBLP BibTeX RDF
18	Kaio Karam, Diana Sasaki	Semi blowup and blowup snarks and Berge-Fulkerson Conjecture.	CTW	2013	DBLP BibTeX RDF
18	Fernanda Couto, Luérbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti	On specifying boundary conditions for the graph sandwich problem.	CTW	2013	DBLP BibTeX RDF
18	Sebastiaan J. C. Joosten, Hans Zantema	Relaxation of 3-partition instances.	CTW	2013	DBLP BibTeX RDF
18	Olivier Hudry	Application of the descent with mutations (DWM) metaheuristic to the computation of a median equivalence relation.	CTW	2013	DBLP BibTeX RDF
18	Ismael González Yero, Amaurys Rondón Aguilar	The double projection method for some domination related parameters in Cartesian product graphs.	CTW	2013	DBLP BibTeX RDF
18	Eckhard Steffen	1-factors and circuits of cubic graphs.	CTW	2013	DBLP BibTeX RDF
18	Xavier Molinero, Fabián Riquelme, Maria J. Serna	Star-shaped mediation in influence games.	CTW	2013	DBLP BibTeX RDF
18	Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki	On total coloring and equitable total coloring of cubic graphs with large girth.	CTW	2013	DBLP BibTeX RDF
18	Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan	Online checkpointing with improved worst-case guarantees.	CTW	2013	DBLP BibTeX RDF
18	Roland H. Kaschek, Alexander Krumpholz	An extension of the Collatz function.	CTW	2013	DBLP BibTeX RDF
18	Christina Büsing, Fabio D'Andreagiovanni, Annie Raymond	Robust optimization under multiband uncertainty.	CTW	2013	DBLP BibTeX RDF
18	Ján Manuch, Murray Patterson, Roland Wittler, Cédric Chauve, Eric Tannier	Linearization of ancestral multichromosomal genomes.	CTW	2013	DBLP BibTeX RDF
18	Ruben Hoeksma, Marc Uetz	Two-dimensional optimal mechanism design for a single machine scheduling problem.	CTW	2013	DBLP BibTeX RDF
18	Radu Curticapean, Marvin Künnemann	A quantization framework for smoothed analysis on Euclidean optimization problems.	CTW	2013	DBLP BibTeX RDF
18	Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin	Smoothed analysis of the successive shortest path algorithm.	CTW	2013	DBLP BibTeX RDF
18	Ekrem Duman, Ahmet Altun	Routing ATM loading vehicles.	CTW	2013	DBLP BibTeX RDF
18	Thatchaphol Saranurak	Finding the colors of the secret in Mastermind.	CTW	2013	DBLP BibTeX RDF
18	Michael Etscheid	Performance guarantees for scheduling algorithms under perturbed machine speeds.	CTW	2013	DBLP BibTeX RDF
18	Mirjam Friesen, Dirk Oliver Theis	Fooling-sets and rank in nonzero characteristic.	CTW	2013	DBLP BibTeX RDF
18	Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen	Playing Mastermind with Many Colors.	CTW	2012	DBLP BibTeX RDF
18	Dmitrii Lozovanu, Stefan Pickl	Nash Equilibria Conditions for Stochastic Cyclic Games on Networks.	CTW	2012	DBLP BibTeX RDF
18	Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici	Scheduling Two Chains on Parallel Dedicated Machines.	CTW	2012	DBLP BibTeX RDF
18	Maurizio Bruglieri, Alberto Colorni, Tatjana Davidovic, Sanja Roksandic	A Matheuristic Approach for the University Carpooling Problem.	CTW	2012	DBLP BibTeX RDF
18	Roland H. Kaschek	Towards Reconstructing Graphs with End Vertices.	CTW	2012	DBLP BibTeX RDF
18	Ahmet N. Ceranoglu, Ekrem Duman	VRP12 - A New Variant of the Vehicle Routing Problem.	CTW	2012	DBLP BibTeX RDF
18	Yen Hung Chen	Approximation Hardness of the Mixed Dominating Set Problem.	CTW	2012	DBLP BibTeX RDF
18	Andreas Brieden, Peter Gritzmann, Bernhard Reinbold	A Posteriori Vehicle Fleet Optimization and Scenario Evaluation.	CTW	2012	DBLP BibTeX RDF
18	Sonia De Cosmis, Renato De Leone, Erik Kropat, Silja Meyer-Nieberg, Stefan Pickl, Jessica Rosati	Electric Load Forecasting: An Experimental Comparison.	CTW	2012	DBLP BibTeX RDF
18	Victor A. Campos, Rudini Menezes Sampaio, Ana Silva 0001, Jayme Luiz Szwarcfiter	Graphs with Few P4's Under the Convexity of Paths of Order Three.	CTW	2012	DBLP BibTeX RDF
18	Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis	Abstract Flows over Time.	CTW	2012	DBLP BibTeX RDF
18	Olivier Hudry	Majority Graphs of Profiles of Equivalence Relations and Complexity of Réegnier's Problem.	CTW	2012	DBLP BibTeX RDF
18	Matjaz Kovse	Expansion Procedures and Buneman Hypergraphs.	CTW	2012	DBLP BibTeX RDF
18	Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot	A Database of Interesting Graphs: The House of Graphs.	CTW	2012	DBLP BibTeX RDF
18	Nacira Chikhi, Moncef Abbas	Minimizing the Makespan in a Robotic Cell Scheduling Problem.	CTW	2012	DBLP BibTeX RDF
18	Pablo Adasme, Abdel Lisser	A Semidefinite Relaxation Approach for Stochastic Bilevel Programming.	CTW	2012	DBLP BibTeX RDF
18	Hocine Boumediene Merouane, Mohammed Haddad 0001, Mustapha Chellali, Hamamache Kheddouci	Dominated Coloring of Graphs.	CTW	2012	DBLP BibTeX RDF
18	Stefan Waldherr	A Generalized Graph Coloring Approach to Periodic Scheduling.	CTW	2012	DBLP BibTeX RDF
18	Robert Scheidweiler, Eberhard Triesch	New Estimations of the Gap-k-coloring Number.	CTW	2012	DBLP BibTeX RDF
18	Adrian Kügel	Average Case Complexity of Branch-and-Bound Algorithms on Random b-ary Trees.	CTW	2012	DBLP BibTeX RDF
18	Troy Lee, Dirk Oliver Theis	Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial Optimization Problems.	CTW	2012	DBLP BibTeX RDF
18	Jianqiang Cheng, Abdel Lisser	Maximum Probability Problem in Stochastic Programming.	CTW	2012	DBLP BibTeX RDF
18	Polona Pavlic, Janez Zerovnik	A Constant Time Algorithm for Domination Problems on Polygraphs.	CTW	2012	DBLP BibTeX RDF
18	Charles A. Phillips, Jeremy J. Jay, Erich J. Baker, Elissa J. Chesler, Michael A. Langston	On Bipartite Graph Decomposition in the Presence of Noise, with Applications to Biological Data Clustering.	CTW	2012	DBLP BibTeX RDF
18	Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari	k-Piecewise Affine Model Fitting: Heuristics Based on Multiway Linear Classification.	CTW	2012	DBLP BibTeX RDF
18	Sarfraz Ahmad, Imran Anwar	On f and h Triangles of a Simplicial Complex.	CTW	2012	DBLP BibTeX RDF
18	Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy	Strategies for Single-machine Multi-agent Scheduling Problems.	CTW	2012	DBLP BibTeX RDF
18	Sandro Bosio, Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis, Martin Skutella	Flows over Time with Negative Transit Times and Arc Release Dates.	CTW	2012	DBLP BibTeX RDF